#include <bits/stdc++.h>
using namespace std;
void test_case() {
  int n;
  long long w;
  cin >> n >> w;
  long long sum = 0;
  vector<int> a(n);
  int ind = -1;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] <= w) {
      sum += a[i];
      if (a[i] >= (w + 1) / 2) {
        ind = i;
      }
    }
  }
  if (sum < (w + 1) / 2) {
    cout << -1 << endl;
    return;
  }
  if (ind != -1) {
    cout << 1 << endl;
    cout << ind + 1 << endl;
    return;
  }
  long long csum = 0;
  vector<int> ans;
  for (int i = 0; i < n; i++) {
    if (a[i] <= w) {
      if (csum < (w + 1) / 2) {
        csum += a[i];
        ans.push_back(i);
      }
    }
  }
  cout << ans.size() << endl;
  for (auto x : ans) {
    cout << x + 1 << " ";
  }
  cout << endl;
  return;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    test_case();
  }
  return 0;
}
