#include <bits/stdc++.h>
using namespace std;
long long n, w;
void solve() {
  cin >> n >> w;
  vector<pair<long long, long long>> v(n);
  vector<long long> ans;
  long long x = ((w % 2 == 0) ? w / 2 : (w + 1) / 2);
  long long ax, sum = 0;
  for (long long i = 0; i < n; ++i) {
    long long a;
    cin >> a;
    v[i] = {a, i + 1};
  }
  sort(v.begin(), v.end());
  if (v[0].first > w) {
    cout << -1 << '\n';
    return;
  }
  for (long long i = 0; i < n; ++i) {
    if (v[i].first > w) {
      ax = i - 1;
      break;
    }
    if (i == n - 1) {
      ax = n - 1;
    }
  }
  for (long long i = ax; i >= 0; i--) {
    sum += v[i].first;
    ans.push_back(v[i].second);
    if (sum >= x) break;
    if (i == 0) {
      cout << -1 << '\n';
      return;
    }
  }
  cout << ans.size() << '\n';
  for (auto it : ans) cout << it << " ";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }
  return 0;
}
