#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e11 + 7;
const long long int N = 1e6;
bool prime[N + 1];
const long long int md = 1e9 + 7;
void solve() {
  long long int n, w;
  cin >> n >> w;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int sum = 0;
  vector<long long int> v;
  long long int c = (w + 1) / 2;
  for (long long int i = 0; i < n; i++) {
    if (a[i] >= c && a[i] <= w) {
      cout << 1 << "\n";
      cout << i + 1 << "\n";
      return;
    }
    if (a[i] <= w) sum += a[i];
  }
  if (sum < c) {
    cout << -1 << "\n";
    return;
  }
  long long int cur = 0;
  for (long long int i = 0; i < n; i++) {
    if (cur + a[i] <= w) {
      cur += a[i];
      v.push_back(i + 1);
    }
  }
  cout << v.size() << "\n";
  for (long long int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
