#include <bits/stdc++.h>
using namespace std;
int T, n;
long long w, a[222000];
void solve() {
  cin >> n >> w;
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long s = 0;
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    if (w < a[i]) continue;
    if (w <= 2 * a[i]) {
      cout << 1 << endl << i << endl;
      return;
    }
    s += a[i];
    ans.push_back(i);
    if (w <= 2 * s) {
      cout << ans.size() << endl;
      for (auto e : ans) cout << e << " ";
      cout << endl;
      return;
    }
  }
  cout << "-1\n";
}
int main() {
  cin >> T;
  while (T--) solve();
  return 0;
}
