#include <bits/stdc++.h>
using namespace std;
int t;
int main() {
  cin >> t;
  while (t--) {
    long long int n, W;
    cin >> n >> W;
    vector<pair<long long int, long long int> > v;
    for (long long int i = 1; i <= n; i++) {
      long long int val;
      cin >> val;
      v.push_back(make_pair(val, i));
    }
    sort(v.begin(), v.end());
    vector<long long int> printv;
    if (v[0].first > W) {
      cout << "-1" << endl;
      continue;
    }
    bool flag = 0;
    for (int i = 1; i < v.size(); i++) {
      if (v[i].first >= W / 2 + (W % 2) && v[i].first <= W) {
        cout << "1" << endl << v[i].second << endl;
        flag = 1;
        break;
      }
    }
    long long int sum = 0;
    long long int cnt = 0;
    bool lol = 0;
    if (flag == 0) {
      long long int i = 0;
      while (sum < W / 2 + (W % 2)) {
        if (i >= v.size()) {
          lol = 1;
          break;
        }
        sum += v[i].first;
        if (sum <= W) {
          printv.push_back(v[i].second);
          cnt++;
          i++;
        } else {
          lol = 1;
        }
      }
      if (lol == 1) {
        cout << "-1" << endl;
        continue;
      }
      cout << cnt << endl;
      sort(printv.begin(), printv.end());
      for (long long int i = 0; i < printv.size(); i++) {
        cout << printv[i] << " ";
      }
      cout << "\n";
    }
  }
  return 0;
}
