#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, size = 1 << 20, mod = 998244353, inf = 2e9;
const long long INF = 1e15;
template <class o>
void qr(o& x) {
  char c = getchar();
  x = 0;
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  x *= f;
}
template <class o>
void qw(o x) {
  if (x / 10) qw(x / 10);
  putchar(x % 10 + '0');
}
template <class o>
void pr1(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar(' ');
}
template <class o>
void pr2(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar('\n');
}
long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long power(long long a, long long b = mod - 2, long long p = mod) {
  long long c = 1;
  while (b) {
    if (b & 1) c = c * a % p;
    b /= 2;
    a = a * a % p;
  }
  return c;
}
template <class o>
void cmax(o& x, o y) {
  if (x < y) x = y;
}
template <class o>
void cmin(o& x, o y) {
  if (x > y) x = y;
}
template <typename t1, typename t2>
void ad(t1& x, t2 y) {
  x += y;
  if (x >= mod) x -= mod;
}
template <typename t1, typename t2>
void dl(t1& x, t2 y) {
  x -= y;
  if (x < 0) x += mod;
}
template <typename T>
struct BIT {
  T* c;
  int n;
  BIT(int _n) : n(_n) {
    c = new T[n];
    c--;
    for (int i = 1; i <= n; i++) c[i] = T(0);
  }
  void add(int x, T y) {
    for (; x <= n; x += x & -x) c[x] = c[x] + y;
  }
  T sum(int x) {
    T y = T(0);
    for (; x; x &= x - 1) y = y + c[x];
    return y;
  }
};
long long jc[N], inv[N];
void jc_init(int n) {
  jc[0] = 1;
  for (int i = 1; i <= n; i++) jc[i] = jc[i - 1] * i % mod;
  inv[n] = power(jc[n]);
  for (int i = n; i; i--) inv[i - 1] = inv[i] * i % mod;
}
long long C(int x, int y) {
  if (x < y || y < 0) return 0;
  return jc[x] * inv[y] % mod * inv[x - y] % mod;
}
int n, vis[N], ts;
long long sum, w, l, r, s = 0;
pair<int, int> a[N];
void solve() {
  qr(n);
  qr(w);
  l = (w + 1) / 2;
  r = w;
  sum = s = 0;
  a[n + 1] = make_pair(0, n + 1);
  for (int i = 1; i <= n; i++) qr(a[i].first), a[i].second = i;
  sort(a + 1, a + n + 1, greater<pair<int, int> >());
  int i = 1;
  while (i <= n && a[i].first > w) i++;
  if (a[i].first >= l) {
    puts("1");
    pr2(a[i].second);
  } else if (i == n + 1)
    puts("-1");
  else {
    int j = i;
    s = 0;
    while (j <= n && s < l) s += a[j++].first;
    if (s < l) {
      puts("-1");
      return;
    }
    pr2(j - i);
    for (int k = i; k <= j - 1; k++) pr1(a[k].second);
    puts("");
  }
}
int main() {
  int T = 1;
  qr(T);
  while (T--) solve();
  return 0;
}
