#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
int INF = 1e9;
void calculate(long long n, long long w) {
  vector<pair<long long, long long> > data(n);
  for (int i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    pair<long long, long long> y = make_pair(x, i + 1);
    data[i] = y;
  }
  sort(data.rbegin(), data.rend());
  long long C = 0;
  vector<long long> ans;
  for (int i = 0; i < n; ++i) {
    if (data[i].first <= w) {
      if (C + data[i].first > w) continue;
      C += data[i].first;
      ans.push_back(data[i].second);
    }
  }
  sort(ans.begin(), ans.end());
  if (2 * C < w) {
    cout << "-1"
         << "\n";
    return;
  }
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); ++i) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  cin >> T;
  while (T--) {
    long long n, w;
    cin >> n >> w;
    calculate(n, w);
  }
}
