#include <bits/stdc++.h>
using namespace std;
const int MAX = 500005;
long long b[MAX];
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n, W;
    cin >> n >> W;
    vector<pair<int, int>> a;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      a.push_back(make_pair(x, i + 1));
    }
    int mins = ceil(W * 1.0 / 2);
    sort(a.begin(), a.end(), cmp);
    long long c = 0;
    vector<int> ans;
    bool flag = false;
    for (int i = 0; i < n; i++) {
      if (c + a[i].first <= W) {
        c += a[i].first;
        ans.push_back(a[i].second);
      }
      if (c * 2 >= W) {
        flag = true;
        break;
      }
    }
    if (flag && c >= mins) {
      cout << ans.size() << endl;
      for (int i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
      }
      cout << endl;
    } else {
      cout << -1 << endl;
    }
  }
  return 0;
}
