#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int T, n;
long long W;
pair<long long, int> w[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  for (cin >> T; T--;) {
    vector<int> id;
    cin >> n >> W;
    long long x = W;
    for (int i = 1; i <= n; ++i) cin >> w[i].first, w[i].second = i;
    sort(w + 1, w + n + 1, greater<pair<int, int> >());
    for (int i = 1; i <= n; ++i)
      if (w[i].first <= x) x -= w[i].first, id.push_back(w[i].second);
    if (W - x < (W + 1) / 2)
      cout << "-1\n";
    else {
      cout << id.size() << '\n';
      for (int i : id) cout << i << ' ';
      cout << '\n';
    }
  }
  return 0;
}
