#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    long long w;
    cin >> n >> w;
    pair<long long, int> wt[n];
    for (int i = 0; i < n; i++) {
      cin >> wt[i].first;
      wt[i].second = i + 1;
    }
    vector<int> taken;
    sort(wt, wt + n);
    long long current = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (current + wt[i].first <= w) {
        taken.push_back(wt[i].second);
        current += wt[i].first;
      }
      assert(current <= w);
    }
    if (current * 2 >= w) {
      cout << taken.size() << "\n";
      for (int i : taken) cout << i << " ";
      cout << "\n";
    } else {
      cout << "-1\n";
    }
  }
  return 0;
}
