#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, w;
  cin >> n >> w;
  long long req = (w + 1) / 2;
  vector<pair<long long, long long> > ar(n);
  vector<long long> ans;
  for (long long i = 0; i < n; i++) {
    cin >> ar[i].first;
    ar[i].second = i + 1;
  }
  for (long long i = 0; i < n; i++) {
    if (ar[i].first >= req && ar[i].first <= w) {
      cout << "1\n" << ar[i].second << '\n';
      return;
    }
  }
  sort(ar.begin(), ar.end());
  long long cur = 0;
  for (long long i = 0; i < n; i++) {
    if (cur >= req) break;
    cur += ar[i].first;
    ans.push_back(ar[i].second);
  }
  if (ans.empty() || cur > w || cur < req)
    cout << -1 << '\n';
  else {
    cout << ans.size() << '\n';
    for (long long x : ans) cout << x << ' ';
    cout << '\n';
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
