#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
const long long inf64 = 1e18;
const long long MOD = inf + 7;
void solve() {
  long long n, W;
  cin >> n >> W;
  vector<long long> v(n);
  for (long long &x : v) {
    cin >> x;
  }
  vector<long long> ans;
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    if (sum + v[i] <= W) {
      sum += v[i];
      ans.push_back(i + 1);
    }
    if (v[i] >= (W + 1) / 2 && v[i] <= W) {
      ans.clear();
      sum = v[i];
      ans.push_back(i + 1);
    }
  }
  if (sum >= (W + 1) / 2 && sum <= W) {
    cout << ans.size() << "\n";
    for (long long x : ans) {
      cout << x << " ";
    }
    cout << "\n";
  } else {
    cout << "-1\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
