#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(time(nullptr));
void solve() {
  long long n, w;
  cin >> n >> w;
  pair<long long, long long> a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  long long pre[n + 1];
  pre[0] = 0;
  for (long long i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i - 1].first;
  for (long long i = 0; i < n; i++) {
    long long l = -1, r = i + 1;
    while (r > l + 1) {
      long long mid = (r + l) / 2;
      long long sum = pre[i + 1] - pre[i + 1 - mid];
      if (sum > w) {
        r = mid;
        continue;
      }
      if (sum * 2 < w)
        l = mid;
      else
        r = mid;
    }
    if (r != 0 && (pre[i + 1] - pre[i + 1 - r]) * 2 >= w &&
        (pre[i + 1] - pre[i + 1 - r]) <= w) {
      cout << r << endl;
      for (long long j = i; j > i - r; j--) cout << a[j].second + 1 << ' ';
      cout << endl;
      return;
    }
  }
  cout << -1 << endl;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  long long attempts = 1;
  cin >> attempts;
  cout.precision(16);
  while (attempts--) {
    solve();
  }
  return 0;
}
