#include <bits/stdc++.h>
using namespace std;
long long oll = 0;
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first < b.first;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) {
    long long n, w;
    cin >> n >> w;
    long long lwr = w / 2 + (w % 2 != 0);
    vector<pair<long long, long long> > arr;
    vector<long long> items;
    for (long long i = 0; i < n; i++) {
      long long x;
      cin >> x;
      if (x <= w) arr.push_back(make_pair(x, i + 1));
    }
    if (arr.size() == 0) {
      cout << -1 << "\n";
      continue;
    }
    sort(arr.begin(), arr.end(), comp);
    if (arr[arr.size() - 1].first >= lwr) {
      cout << 1 << "\n";
      cout << arr[arr.size() - 1].second << "\n";
      continue;
    }
    int lw = 0, hi = arr.size() - 1;
    long long sum = 0;
    while (lw <= hi) {
      if (sum + arr[hi].first <= w) {
        sum += arr[hi].first;
        items.push_back(arr[hi].second);
        hi--;
        if (sum >= lwr) break;
      } else if (sum + arr[lw].first <= w) {
        sum += arr[lw].first;
        items.push_back(arr[lw].second);
        lw++;
        if (sum >= lwr) break;
      }
    }
    if (sum >= lwr) {
      cout << items.size() << "\n";
      sort(items.begin(), items.end());
      for (long long i = 0; i < items.size(); i++) cout << items[i] << " ";
      cout << "\n";
    } else
      cout << -1 << "\n";
  }
  return 0;
}
