#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, W;
  cin >> n >> W;
  vector<long long> A(n);
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  vector<pair<long long, long long> > B;
  for (int i = 0; i < n; i++) {
    if (A[i] > W) continue;
    if (A[i] >= W / 2 + W % 2) {
      cout << "1\n";
      cout << i + 1 << "\n";
      return;
    }
    B.emplace_back(A[i], i);
  }
  long long s = 0;
  vector<int> ans;
  for (int i = 0; i < (int)B.size(); i++) {
    s += B[i].first;
    ans.push_back(B[i].second);
    if (s >= W / 2 + W % 2) break;
  }
  if (s >= W / 2 + W % 2) {
    cout << ans.size() << "\n";
    for (int i : ans) {
      cout << i + 1 << " ";
    }
    cout << "\n";
  } else {
    cout << "-1\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) solve();
}
