#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, id;
} a[200005];
long long st[200005], top;
bool cmp(node a, node b) { return a.x < b.x; }
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long T;
  cin >> T;
  while (T--) {
    top = 0;
    long long n, w, sum = 0;
    cin >> n >> w;
    for (long long i = 1; i <= n; i++) {
      cin >> a[i].x;
      a[i].id = i;
    }
    for (long long i = 1; i <= n; i++) {
      if ((w + 1) / 2 <= a[i].x && a[i].x <= w) {
        cout << "1\n" << i << "\n";
        goto loop;
      }
    }
    sort(a + 1, a + n + 1, cmp);
    while (a[n].x >= w) {
      n--;
    }
    for (long long i = n; i >= 1; i--) {
      if (sum + a[i].x <= w) {
        sum += a[i].x;
        st[++top] = a[i].id;
      }
      if ((w + 1) / 2 <= sum) {
        cout << top << "\n";
        for (long long i = 1; i <= top; i++) {
          cout << st[i] << " ";
        }
        cout << "\n";
        goto loop;
      }
    }
    cout << "-1\n";
  loop:;
  }
}
