#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
pair<long long, long long> a[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    w++;
    long long comp = w / 2;
    for (long long i = 0; i < n; i++) {
      cin >> a[i].first;
      a[i].second = i;
    }
    sort(a, a + n);
    reverse(a, a + n);
    vector<long long> ans;
    long long sum = 0;
    for (long long i = 0; i < n; i++)
      if (sum + a[i].first < w) {
        sum += a[i].first;
        ans.push_back(a[i].second + 1);
      }
    if (sum < comp || sum >= w)
      cout << -1 << '\n';
    else {
      cout << ans.size() << '\n';
      for (long long i : ans) cout << i << ' ';
      cout << '\n';
    }
  }
  return 0;
}
