#include <bits/stdc++.h>
using namespace std;
const long int N = 1005;
long long n, m, i, j, k;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    long long w;
    cin >> n >> w;
    vector<pair<long, long> > v;
    long x;
    for (i = 0; i < n; i++) cin >> x, v.push_back({x, i});
    sort(v.begin(), v.end());
    long long l = w / 2 + (w % 2), h = w;
    long long sum = 0;
    j = 0;
    bool f = 0;
    for (i = 0; i < n; i++) {
      if (v[i].first > h) break;
      sum += v[i].first;
      if (sum >= l && sum <= h) {
        f = 1;
        break;
      }
      while (j <= i && sum > h) {
        sum -= v[j].first;
        j++;
      }
      if (sum >= l && sum <= h) {
        f = 1;
        break;
      }
    }
    if (f) {
      cout << i - j + 1 << "\n";
      for (k = j; k <= i; k++) cout << v[k].second + 1 << " ";
      cout << "\n";
    } else {
      cout << "-1\n";
    }
  }
  return 0;
}
