#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod1 = 998244353;
const long long inf = 1e18;
const long long nax = 200005;
long long n, w, a[nax];
void OUTPUT(deque<long long> ans) {
  cout << ans.size() << '\n';
  for (long long x : ans) cout << x << " ";
  cout << '\n';
}
void solve() {
  cin >> n >> w;
  vector<pair<long long, long long> > v;
  for (long long i = (1); i < (n + 1); i++) {
    cin >> a[i];
    v.push_back({a[i], i});
  }
  sort(v.begin(), v.end(), greater<pair<long long, long long> >());
  deque<long long> ans;
  long long sum = 0;
  for (long long i = (0); i < (n); i++) {
    while (sum > w && !ans.empty()) {
      long long idx = ans.front();
      ans.pop_front();
      sum -= a[idx];
    }
    if (sum >= (w + 1) / 2 && sum <= w) {
      OUTPUT(ans);
      return;
    }
    sum += v[i].first;
    ans.push_back(v[i].second);
    if (sum >= (w + 1) / 2 && sum <= w) {
      OUTPUT(ans);
      return;
    }
  }
  cout << -1 << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
