#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
void solve() {
  long long n, W;
  cin >> n >> W;
  long long sum = 0;
  vector<long long> v0, v1;
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    if (x < (W + 1) / 2 and sum + x <= W)
      v0.push_back(i), sum += x;
    else if (x >= (W + 1) / 2 and x <= W)
      v1.push_back(i);
  }
  if (sum >= (W + 1) / 2) {
    cout << v0.size() << '\n';
    for (long long i : v0) cout << i + 1 << ' ';
    cout << '\n';
  } else if (!v1.empty()) {
    cout << 1 << '\n';
    cout << v1[0] + 1 << '\n';
  } else
    cout << -1 << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
