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