#include <bits/stdc++.h>
using namespace std;
void test() {
  int n, it;
  long long int w;
  cin >> n >> w;
  long long int half = (w + 1) / 2;
  vector<pair<int, int>> item;
  item.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> it;
    item[i] = make_pair(it, i + 1);
  }
  sort(item.rbegin(), item.rend());
  long long int sum = 0;
  vector<int> ans;
  bool ok = 0;
  for (int i = 0; i < n; ++i) {
    it = item[i].first;
    if (it >= half) {
      if (it > w) {
        continue;
      }
      ans.push_back(item[i].second);
      ok = 1;
      break;
    } else {
      sum += (long long)it;
      ans.push_back(item[i].second);
      if (sum >= half) {
        ok = 1;
        break;
      }
    }
  }
  if (ok) {
    int s = ans.size();
    cout << s << '\n';
    for (int i = 0; i < s; ++i) {
      cout << ans[i] << ' ';
    }
  } else {
    cout << -1;
  }
  cout << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    test();
  }
  return 0;
}
