#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    vector<pair<long long, long long>> v(n);
    long long hw = (w + 1) / 2;
    for (int i = 0; i < n; i++) {
      cin >> v[i].first;
      v[i].second = i + 1;
    }
    sort(v.begin(), v.end());
    bool ok = true;
    long long lft = 0, rht = n - 1;
    while (lft <= rht and ok) {
      long long md = (lft + rht) / 2;
      long long sum = 0;
      for (int i = md; i >= 0 and ok; i--) {
        sum += v[i].first;
        if (hw <= sum and sum <= w) {
          cout << md - i + 1 << endl;
          for (int j = i; j <= md; j++) cout << v[j].second << " ";
          cout << endl;
          ok = false;
        }
      }
      if (!ok)
        break;
      else if (sum > w)
        rht = md - 1;
      else
        lft = md + 1;
    }
    if (ok) cout << -1 << endl;
  }
  return 0;
}
