#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e6 + 5;
void pairsort(long long a[], long long b[], long long n) {
  pair<long long, long long> pairt[n];
  for (long long i = 0; i < n; i++) {
    pairt[i].first = a[i];
    pairt[i].second = b[i];
  }
  sort(pairt, pairt + n);
  for (long long i = 0; i < n; i++) {
    a[i] = pairt[i].first;
    b[i] = pairt[i].second;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
long long C(long long n, long long r) {
  if (r > n - r) r = n - r;
  long long ans = 1;
  for (long long i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
  long long res = 1;
  x = x % mod;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % mod;
    res %= mod;
  }
  return res;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long t, n, w, x;
vector<pair<long long, long long>> v;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> t;
  while (t--) {
    cin >> n >> w, v.clear();
    for (long long i = 1; i <= n; i++) cin >> x, v.push_back({x, i});
    sort(v.begin(), v.end());
    long long p1 = 0, p2 = 0, sum = v[0].first;
    bool flag = false;
    while (p2 < n) {
      if (sum >= (w + 1) / 2 && sum <= w) {
        cout << p2 - p1 + 1 << "\n";
        for (long long j = p1; j <= p2; j++) cout << v[j].second << " ";
        cout << "\n";
        flag = true;
        break;
      }
      if (sum > w) {
        if (p1 < p2)
          sum -= v[p1].first, p1++;
        else {
          p2++;
          if (p2 < n) sum += v[p2].first;
        }
      }
      if (sum < (w + 1) / 2) {
        p2++;
        if (p2 < n) sum += v[p2].first;
      }
    }
    if (flag == false) cout << -1 << "\n";
  }
  return 0;
}
