#include <bits/stdc++.h>
using namespace std;
int main() {
  int test;
  cin >> test;
  while (test--) {
    int n;
    long long W;
    cin >> n >> W;
    pair<int, int> a[n + 11];
    for (int i = 1; i <= n; i++) {
      cin >> a[i].first;
      a[i].second = i;
    }
    sort(a + 1, a + n + 1);
    long long sum = 0;
    long long mid = (W + 1) / 2;
    int d = 0;
    for (int i = 1; i <= n; i++) {
      if (sum + a[i].first >= mid && sum + a[i].first <= W) {
        cout << i << endl;
        d = 1;
        for (int j = 1; j <= i; j++) cout << a[j].second << ' ';
        cout << endl;
        break;
      } else if (sum + a[i].first < mid)
        sum += a[i].first;
      else if (sum + a[i].first > W) {
        if (a[i].first <= W && a[i].first >= mid) {
          cout << 1 << endl;
          cout << a[i].second << endl;
          d = 1;
          break;
        } else {
          break;
        }
      }
    }
    if (!d) {
      cout << -1 << endl;
    }
  }
}
