#include <bits/stdc++.h>
using namespace std;
const long long N = 200005;
pair<int, int> a[N];
void solve() {
  long long n, m = 0, k = 0, i = 1, j = 0, f, l, r;
  long long ans = -1e9, sum = 0, x = 0, y = 0, q;
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  for (i = 0; i < n; i++) {
    sum += a[i].first;
    if (sum >= (m + 1) / 2 && sum <= m) {
      cout << i + 1 << endl;
      for (j = 0; j <= i; j++) {
        cout << a[j].second << " ";
      }
      cout << endl;
      return;
    }
    if (a[i].first >= (m + 1) / 2 && a[i].first <= m) {
      cout << "1\n";
      cout << a[i].second << endl;
      return;
    }
  }
  cout << "-1\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
