#include <bits/stdc++.h>
using namespace std;
int dr[8] = {-1, 0, +1, 0, -1, -1, +1, +1};
int dc[8] = {0, +1, 0, -1, -1, +1, -1, +1};
int kx[8] = {-1, +1, +1, -1, +2, +2, -2, -2};
int ky[8] = {+2, +2, -2, -2, -1, +1, +1, -1};
const int N = 100005;
void solve() {
  int n;
  long long w, x;
  cin >> n >> w;
  vector<pair<long long, int>> a;
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    a.push_back({x, i});
  }
  sort(a.rbegin(), a.rend());
  vector<long long> vec;
  long long sum = 0;
  for (int i = 0; i <= n - 1; ++i) {
    if (sum + a[i].first <= w) vec.push_back(a[i].second), sum += a[i].first;
  }
  if (sum >= ((w + 1) / 2) && sum <= w) {
    cout << vec.size() << endl;
    for (auto i : vec) cout << i << ' ';
    cout << endl;
  } else
    cout << -1 << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
