#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n, w, id = -1;
    cin >> n >> w;
    vector<pair<long long int, long long int> > vet(n);
    for (int i = 0; i < n; i++) {
      cin >> vet[i].first;
      vet[i].second = i;
      if (vet[i].first >= (w + 1) / 2 && vet[i].first <= w) id = i;
    }
    sort(vet.begin(), vet.end());
    if (id >= 0)
      cout << "1\n" << id + 1;
    else {
      bool r = 0;
      long long int j = n - 1, i = 0, sum = vet[j].first;
      while (sum >= w && j >= 0) j--, sum = vet[j].first;
      for (; i < j; i++) {
        sum += vet[i].first;
        while (sum > w && j - 1 > i)
          j--, sum -= vet[j + 1].first, sum += vet[j].first;
        if (sum >= (w + 1) / 2 && sum <= w) {
          r = 1;
          break;
        }
      }
      if (r) {
        cout << i + 2 << "\n" << vet[j].second + 1 << " ";
        for (; i >= 0; i--) cout << vet[i].second + 1 << " ";
      } else
        cout << -1;
    }
    cout << "\n";
  }
}
