#include <bits/stdc++.h>
using namespace std;
mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
const int N = 2e5 + 7;
const int M = 1e9 + 7;
pair<int, int> w[N];
void solve() {
  int n;
  long long W;
  cin >> n >> W;
  for (int i = 0; i < n; i++) cin >> w[i].first, w[i].second = i;
  sort(w, w + n);
  long long cur = 0;
  vector<int> ans;
  for (int i = n - 1; i >= 0; --i) {
    if (cur + w[i].first <= W)
      cur += w[i].first, ans.push_back(w[i].second + 1);
  }
  if (cur * 2ll >= W) {
    cout << ans.size() << '\n';
    for (auto it : ans) cout << it << ' ';
  } else
    cout << -1;
  cout << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
