#include <bits/stdc++.h>
using namespace std;
int main() {
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    long long w;
    scanf("%d%lld", &n, &w);
    vector<pair<int, int>> f(n);
    for (int i = 0; i < n; i++) {
      scanf("%d", &f[i].first);
      f[i].second = i + 1;
    }
    sort(f.rbegin(), f.rend());
    vector<int> idx;
    long long sm = 0;
    for (int i = 0; i < n; i++) {
      if (sm + f[i].first <= w) {
        idx.push_back(f[i].second);
        sm += f[i].first;
      }
    }
    if (sm <= w && sm >= (w + 1) / 2) {
      printf("%d\n", (int)idx.size());
      for (auto it : idx) printf("%d ", it);
      printf("\n");
    } else {
      printf("-1\n");
    }
  }
  return 0;
}
