#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> w[200005];
int main() {
  long long t, n, W, sum = 0, x, y;
  cin >> t;
  while (t--) {
    sum = 0;
    cin >> n >> W;
    y = W / 2;
    if (W & 1) y++;
    x = -1;
    for (int i = 0; i < n; i++) {
      cin >> w[i].first;
      if (w[i].first <= W && w[i].first >= y) {
        if (x != -2) cout << 1 << endl << i + 1 << endl;
        x = -2;
      }
      w[i].second = i;
    }
    if (x == -2) continue;
    sort(w, w + n);
    for (int i = 0; i < n; i++) {
      sum += w[i].first;
      if (sum >= y && sum <= W) {
        x = i;
        break;
      }
    }
    if (x < 0) {
      cout << -1 << endl;
    } else {
      cout << x + 1 << endl;
      for (int i = 0; i <= x; i++) {
        cout << w[i].second + 1 << ' ';
      }
      cout << endl;
    }
  }
  return 0;
}
