#include <bits/stdc++.h>
using namespace std;
int tt;
int n;
long long W;
int main() {
  cin >> tt;
  while (tt--) {
    cin >> n >> W;
    vector<int> w(n);
    for (int i = 0; i < n; i++) cin >> w[i];
    vector<int> id(n);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](int i, int j) { return w[i] < w[j]; });
    sort(w.begin(), w.end());
    while (w.size() && w.back() > W) {
      w.pop_back();
      id.pop_back();
    }
    if (accumulate(w.begin(), w.end(), 0LL) < (W + 1) / 2) {
      cout << "-1\n";
      continue;
    }
    if (w.back() >= (W + 1) / 2) {
      cout << 1 << "\n" << id.back() + 1 << "\n";
      continue;
    }
    long long sum = accumulate(w.begin(), w.end(), 0LL);
    while (sum > W) {
      sum -= w.back();
      w.pop_back();
      id.pop_back();
    }
    cout << id.size() << "\n";
    for (int i : id) cout << i + 1 << " ";
    cout << "\n";
  }
  return 0;
}
