#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MX = 2e5 + 5;
ll w[MX];
void solve() {
  ll n, W;
  cin >> n >> W;
  for (int i = 0; i < n; ++i) cin >> w[i];
  ll M = (W + 1) / 2;
  for (int i = 0; i < n; ++i) {
    if (w[i] >= M && w[i] <= W) {
      cout << 1 << '\n' << i + 1 << '\n';
      return;
    }
  }
  ll sum = 0;
  vector<int> ans;
  for (int i = 0; i < n; ++i) {
    if (w[i] < M) sum += w[i], ans.push_back(i);
    if (sum >= M && sum <= W) {
      cout << ans.size() << '\n';
      for (int x : ans) cout << x + 1 << ' ';
      cout << '\n';
      return;
    }
  }
  cout << -1 << '\n';
}
int main() {
  if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
