#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long int n, W, w, sum = 0;
    cin >> n >> W;
    vector<pair<long long int, long long int>> v;
    queue<long long int> ans;
    for (int i = 1; i <= n; ++i) cin >> w, v.emplace_back(make_pair(w, i));
    sort(v.begin(), v.end());
    for (int i = n - 1; i >= 0; --i) {
      if (v[i].first + sum > W) continue;
      sum += v[i].first;
      ans.push(v[i].second);
    }
    if (sum << 1 < W) {
      cout << -1 << endl;
      continue;
    }
    cout << ans.size() << endl;
    while (!ans.empty()) cout << ans.front() << " ", ans.pop();
    cout << endl;
  }
}
