#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
const int mod1 = 998244353, mod = 1e9 + 7;
const int MAXN = 3e5 + 5, MAXM = 3e5 + 5;
const int inf = 2e9;
const long long linf = 1e18;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n, w;
pair<long long, long long> a[MAXN];
void Solve() {
  cin >> n >> w;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  long long b = (w + 1) / 2;
  sort(a + 1, a + n + 1);
  long long sum = 0;
  for (long long i = 1; i <= n; i++) {
    sum += a[i].first;
    if (sum > w) {
      if (a[i].first > w) {
        cout << "-1\n";
        return;
      } else if (a[i].first >= b) {
        cout << 1 << endl << a[i].second << endl;
        return;
      }
    } else if (sum >= b) {
      cout << i << endl;
      for (long long j = 1; j <= i; j++) cout << a[j].second << ' ';
      cout << endl;
      return;
    }
  }
  if (sum < b) {
    cout << -1 << endl;
    return;
  }
}
signed main() {
  if (fopen(""
            ".inp",
            "r")) {
    freopen(
        ""
        ".inp",
        "r", stdin);
    freopen(
        ""
        ".out",
        "w", stdout);
  };
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long TC = 1;
  cin >> TC;
  while (TC--) Solve();
  return 0;
}
