#include <bits/stdc++.h>
using namespace std;
long long m = 1000000007;
long long fact(long long n);
int modInverse(int a, int m) {
  int m0 = m;
  int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    int q = a / m;
    int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) res = (res % m * i % m) % m;
  return res;
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    long long b[n], a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      b[i] = a[i];
    }
    sort(b, b + n);
    vector<long long> v;
    long long f = 0, sm = 0;
    if (w == 1) {
      if (b[0] == 1) {
        cout << "1\n";
        for (long long i = 0; i < n; i++) {
          if (a[i] == 1) {
            cout << i + 1 << endl;
            break;
          }
        }
      } else {
        cout << "-1\n";
      }
      continue;
    }
    for (long long i = 0; i < n; i++) {
      if (a[i] < (w + 1) / 2) {
        sm += a[i];
        v.push_back(1 + i);
      } else if (a[i] <= w && a[i] >= (w + 1) / 2) {
        sm = a[i];
        v.clear();
        v.push_back(i + 1);
      }
      if (sm <= w && sm >= (w + 1) / 2) {
        f = 1;
        break;
      }
    }
    if (f == 1) {
      cout << v.size() << endl;
      for (long long i = 0; i < v.size(); i++) {
        cout << v[i] << " ";
      }
      cout << endl;
    } else {
      cout << "-1\n";
    }
  }
  return 0;
}
