#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, W;
  cin >> n >> W;
  vector<pair<long long int, long long int>> w(n);
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    w[i] = {x, i + 1};
  }
  sort(w.begin(), w.end());
  long long int l = 0, sum = 0, lo = (W - 1) / 2 + 1, hi = W;
  for (int r = 0; r < n; r++) {
    sum += w[r].first;
    if (sum < lo) continue;
    while (sum > hi) {
      sum -= w[l].first;
      l++;
    }
    if (lo <= sum && sum <= hi) {
      cout << r - l + 1 << "\n";
      while (l <= r) {
        cout << w[l].second << " ";
        l++;
      }
      cout << "\n";
      return;
    }
  }
  cout << -1 << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }
  return 0;
}
