#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, w;
  cin >> n >> w;
  long long a[n];
  vector<long long> index;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    if (sum + a[i] <= w) {
      sum += a[i];
      index.push_back(i + 1);
    } else if (a[i] <= w && a[i] >= (w + 1) / 2) {
      cout << "1"
           << "\n";
      cout << i + 1 << "\n";
      return;
    } else {
      continue;
    }
  }
  if (sum >= (w + 1) / 2) {
    cout << (long long)index.size() << "\n";
    for (long long i = 0; i < (long long)index.size(); i++) {
      cout << index[i] << " ";
    }
    cout << "\n";
  } else {
    cout << "-1"
         << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test_case = 1;
  cin >> test_case;
  for (long long i = 1; i <= test_case; i++) {
    solve();
  }
}
