#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 200100;
int n;
pair<int, int> w[maxn];
ll k;
void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> w[i].first, w[i].second = i;
  sort(w + 1, w + 1 + n, greater<pair<int, int> >());
  ll sum = 0;
  vector<int> ans;
  for (int i = 1; i <= n; ++i) {
    if (sum + w[i].first > k) continue;
    sum += w[i].first;
    ans.push_back(w[i].second);
  }
  if (sum >= (k + 1) / 2) {
    cout << (int)ans.size() << '\n';
    for (int first : ans) cout << first << ' ';
    cout << '\n';
  } else
    cout << "-1\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) solve();
}
