#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, w, s = 0, c = 0, i, j, p = 0, q = 0;
    cin >> n >> w;
    long long h = w / 2 + w % 2;
    pair<long long, long long> a[200000];
    for (i = 0; i < n; i++) {
      cin >> a[i].first;
      a[i].second = i;
      if (a[i].first >= h && a[i].first <= w) {
        p = 1;
        q = a[i].second;
      }
    }
    sort(a, a + n);
    if (p == 1) {
      cout << "1\n" << q + 1 << endl;
      continue;
    }
    for (i = 0; i < n; i++) {
      s += a[i].first;
      c++;
      if (s > w) {
        cout << -1 << endl;
        break;
      } else if (s >= h && s <= w) {
        cout << c << endl;
        for (j = 0; j <= i; j++) {
          cout << a[j].second + 1 << " ";
        }
        cout << "\n";
        break;
      }
    }
    if (s < h) {
      cout << -1 << endl;
    }
  }
}
