#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vpll = vector<pair<ll, ll>>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
void solve() {
  ll n, w, sum = 0, l, dem = 0;
  pll a[maxn];
  vll b;
  deque<ll> ans;
  cin >> n >> w;
  l = (w + 1) / 2;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].first;
    a[i].second = i;
    sum += a[i].first;
    if (a[i].first >= l && a[i].first <= w) ans.push_back(i);
    if (a[i].first < l && dem < l) {
      b.push_back(i);
      dem += a[i].first;
    }
  }
  if (ans.size()) {
    cout << 1 << '\n' << ans.front() << '\n';
    return;
  }
  if (dem >= l) {
    cout << b.size() << '\n';
    for (auto x : b) cout << x << ' ';
    cout << '\n';
    return;
  }
  cout << -1 << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
