#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if ((n % i == 0) || (n % (i + 2) == 0)) return false;
  }
  return true;
}
const long long N = 2e5 + 5;
const long long MOD = 1e9 + 7;
long long fact[N], invfact[N];
long long pow(long long a, long long b, long long m) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans;
}
long long modinv(long long k) { return pow(k, MOD - 2, MOD); }
void precompute() {
  fact[0] = fact[1] = 1;
  for (long long i = 2; i < N; i++) {
    fact[i] = fact[i - 1] * i;
    fact[i] %= MOD;
  }
  invfact[N - 1] = modinv(fact[N - 1]);
  for (long long i = N - 2; i >= 0; i--) {
    invfact[i] = invfact[i + 1] * (i + 1);
    invfact[i] %= MOD;
  }
}
long long nCr(long long x, long long y) {
  if (y > x) return 0;
  long long num = fact[x];
  num *= invfact[y];
  num %= MOD;
  num *= invfact[x - y];
  num %= MOD;
  return num;
}
int32_t main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, w;
    cin >> n >> w;
    long long temp = w / 2 + w % 2;
    long long a[n];
    vector<pair<long long, long long> > vec;
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] <= w) vec.push_back({a[i], i});
    }
    sort(vec.begin(), vec.end());
    reverse(vec.begin(), vec.end());
    long long sum = 0;
    vector<long long> v;
    for (long long i = 0; i < vec.size(); i++) {
      if (sum + vec[i].first <= w) {
        v.push_back(vec[i].second + 1);
        sum += vec[i].first;
      } else
        break;
    }
    if (sum >= temp && sum <= w) {
      cout << v.size() << "\n";
      for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
      cout << "\n";
    } else
      cout << "-1"
           << "\n";
  }
}
