#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long c = 0, n, w;
    cin >> n >> w;
    vector<pair<long long, int>> v;
    int arr[n];
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v.push_back(make_pair(x, i + 1));
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    int arr2[n];
    long long cnt = 0;
    for (int i = 0; i < n; i++) {
      if (c + v[i].first <= w) {
        c += v[i].first;
        arr2[cnt] = v[i].second;
        cnt++;
      }
    }
    if (c == 0 || c < ceil((double)w / 2))
      cout << -1;
    else {
      cout << cnt << endl;
      for (int i = 0; i < cnt; i++) cout << arr2[i] << ' ';
    }
    cout << endl;
  }
  return 0;
}
