#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
namespace std {
template <>
struct hash<pii> {
  static hash<ll> hash_ll;
  size_t operator()(const pii& k) const {
    return hash_ll(((ll)k.first << 32) | k.second);
  }
};
}  // namespace std
ll n, W;
vector<pll> weights;
void input() {
  cin >> n >> W;
  weights.clear();
  weights.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> weights[i].first;
    weights[i].second = i + 1;
  }
  sort(weights.begin(), weights.end());
}
void solve() {
  ll cur_sum = 0;
  ll i = n - 1;
  while (i >= 0 && weights[i].first > W) {
    i--;
  }
  ll last_ind = i;
  while (i >= 0 && 2 * cur_sum < W) {
    cur_sum += weights[i].first;
    i--;
  }
  if (2 * cur_sum >= W) {
    cout << last_ind - i << "\n";
    for (int j = i + 1; j <= last_ind; j++) {
      cout << weights[j].second << " ";
    }
    cout << "\n";
  } else {
    cout << -1 << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    input();
    solve();
  }
  return 0;
}
