#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
ll power(ll n, ll k) {
  ll res = 1;
  while (k) {
    if (k & 1) {
      res *= n;
      k--;
    } else {
      n *= n;
      k /= 2;
    }
  }
  return res;
}
void solve() {
  ll n, k;
  cin >> n >> k;
  ll ar[n];
  for (ll i = 0; i < n; i++) cin >> ar[i];
  vector<pair<ll, ll> > vp;
  for (ll i = 0; i < n; i++) vp.push_back({ar[i], i + 1});
  sort(vp.begin(), vp.end());
  vector<ll> ans;
  ll sum = 0;
  bool ok = 0;
  for (ll i = vp.size() - 1; i >= 0; i--) {
    if (vp[i].first >= ceil(k / 2.0) && vp[i].first <= k) {
      cout << 1 << endl;
      cout << vp[i].second << endl;
      return;
    } else if (vp[i].first > k)
      continue;
    else {
      sum += vp[i].first;
      ans.push_back(vp[i].second);
      if (sum >= ceil(k / 2.0) && sum <= k) {
        ok = 1;
        break;
      }
    }
  }
  if (ok) {
    sort(ans.begin(), ans.end());
    cout << ans.size() << endl;
    for (auto x : ans) cout << x << " ";
    cout << endl;
  } else {
    cout << -1 << endl;
  }
}
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(NULL);
  int tc;
  cin >> tc;
  for (; tc--;) {
    solve();
  }
  return 0;
}
