#include <bits/stdc++.h>
using namespace std;
long long M = int(1e9) + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T, i, j;
  cin >> T;
  while (T--) {
    long long n, wt, wh;
    cin >> n >> wt;
    wt& 1 ? wh = (wt / 2) + 1 : wh = wt / 2;
    vector<pair<long long, long long>> w(n);
    for (i = 0; i < n; i++) {
      long long inp;
      cin >> inp;
      w[i] = {inp, i + 1};
    }
    sort(w.begin(), w.end());
    vector<long long> ans;
    bool flag = false;
    long long wc = 0;
    for (i = n - 1; i >= 0; i--) {
      if (w[i].first + wc > wt)
        continue;
      else {
        ans.push_back(w[i].second);
        wc = (wc + w[i].first);
      }
      if (wc >= wh) {
        flag = true;
        break;
      }
    }
    sort(ans.begin(), ans.end());
    if (flag) {
      cout << ans.size() << '\n';
      for (int I = 0; I < ans.size(); I++) cout << ans[I] << " ";
      cout << '\n';
      ;
    } else
      cout << "-1\n";
  }
  return 0;
}
