#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2E5 + 1;
pair<long long, long long> arr[MAXN];
vector<long long> v;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    for (long long i = 0; i < n; i++) {
      cin >> arr[i].first;
      arr[i].second = i + 1;
    }
    sort(arr, arr + n);
    long long sum = 0;
    bool ok = 0;
    v.clear();
    for (long long i = n - 1; i >= 0; i--) {
      if (arr[i].first <= w) {
        v.push_back(arr[i].second);
        sum += arr[i].first;
        if (sum * 2 >= w) {
          ok = 1;
          break;
        }
      }
    }
    if (ok) {
      sort(v.begin(), v.end());
      cout << v.size() << "\n";
      for (long long i = 0; i < v.size(); i++) {
        cout << v[i] << " \n"[i == v.size() - 1];
      }
    } else {
      cout << "-1\n";
    }
  }
  return 0;
}
