#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T& x) {
  T res = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    res = (res << 3) + (res << 1) + c - '0';
    c = getchar();
  }
  x = res * f;
}
const long long N = 200000 + 10;
const int mod = 1e9 + 7;
int t, n;
long long W;
struct node {
  long long w, id;
  bool operator<(const node& c) const { return w > c.w; }
} nod[N];
int main() {
  read(t);
  while (t--) {
    vector<int> ans;
    bool isok = 0;
    read(n);
    read(W);
    long long re = (W + 1) / 2;
    for (int i = 1; i <= n; i++) {
      read(nod[i].w);
      nod[i].id = i;
      if (nod[i].w >= re && nod[i].w <= W && !isok) {
        isok = 1;
        ans.push_back(i);
      }
    }
    if (isok) {
      printf("1\n%d\n", ans[0]);
      continue;
    }
    sort(nod + 1, nod + 1 + n);
    long long sum = 0;
    for (int i = 1; i <= n; i++) {
      if (nod[i].w > W) continue;
      if (sum + nod[i].w <= W) {
        sum += nod[i].w;
        ans.push_back(nod[i].id);
      }
    }
    if (sum <= W && sum >= re) {
      printf("%d\n", ans.size());
      sort(ans.begin(), ans.end());
      for (int x : ans) printf("%d ", x);
      printf("\n");
    } else {
      printf("-1\n");
    }
  }
  return 0;
}
