#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, int> > a;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    a.clear();
    int n, ians = -1;
    long long w, wd;
    cin >> n >> w;
    wd = w / 2 + w % 2;
    for (int i = 0; i < n; i++) {
      int b;
      cin >> b;
      a.push_back(make_pair(b, i + 1));
      if (a[i].first >= wd && a[i].first <= w) ians = i + 1;
    }
    if (ians != -1) {
      cout << '1' << endl << ians << endl;
      continue;
    }
    sort(a.begin(), a.end());
    for (int i = 1; i < n; i++) a[i].first += a[i - 1].first;
    pair<long long, int> p;
    for (int i = 0; i < n; i++) {
      if (i == n - 1) {
        cout << -1 << endl;
        break;
      }
      if (i == 0)
        p.first = 0;
      else
        p.first = a[i - 1].first;
      p.first += wd;
      p.second = 0;
      int l = lower_bound(a.begin() + i, a.end(), p) - a.begin();
      if (l == n) {
        cout << -1 << endl;
        break;
      }
      if (a[l].first - p.first + wd <= w && a[l].first - p.first + wd >= wd) {
        cout << l - i + 1 << endl;
        for (int j = i; j <= l; j++) cout << a[j].second << ' ';
        cout << endl;
        break;
      }
    }
  }
  return 0;
}
