#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    vector<pair<long long, int> > v(n);
    vector<int> ans;
    for (int i = 0; i < n; i++) {
      long long val;
      cin >> val;
      v[i] = {val, i};
    }
    sort(v.begin(), v.end());
    long long tot = 0, f = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (v[i].first > w)
        continue;
      else if (v[i].first >= (w + 1) / 2) {
        ans.push_back(v[i].second);
        f = 1;
        break;
      } else {
        tot += v[i].first;
        ans.push_back(v[i].second);
        if (tot >= (w + 1) / 2) {
          f = 1;
          break;
        }
      }
    }
    if (f == 1) {
      cout << ans.size() << "\n";
      for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " ";
      cout << "\n";
    } else
      cout << -1 << "\n";
  }
  return 0;
}
