#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
long long sum, n, w, a[N];
vector<pair<long long, long long> > v;
vector<long long> res;
set<pair<long long, long long> > s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int q;
  cin >> q;
  while (q--) {
    cin >> n >> w;
    for (int i = 1; i <= n; i++) cin >> a[i], s.insert(make_pair(a[i], i));
    long long cmp = (w + 1) / 2;
    while (sum < cmp && !s.empty()) {
      auto it = s.lower_bound(make_pair((w + 1) / 2, INT_MIN));
      if (it == s.end()) it--;
      if (sum + it->first <= w) sum += it->first, res.push_back(it->second);
      s.erase(it);
    }
    if (sum < cmp)
      cout << -1 << endl;
    else {
      cout << res.size() << endl;
      for (auto i : res) cout << i << ' ';
      cout << endl;
    }
    res.clear();
    s.clear();
    sum = 0;
  }
  return 0;
}
