#include <bits/stdc++.h>
using namespace std;
long long fxp(long long base, long long expo) {
  if (expo == 0) return 1;
  if (expo % 2 == 0) {
    long long c = fxp(base, expo / 2);
    return ((c * c));
  } else
    return ((base * fxp(base, expo - 1)));
}
bool sortByVal(const pair<long long, pair<long long, long long>> &a,
               const pair<long long, pair<long long, long long>> &b) {
  if (a.first == b.first && a.second.first != b.second.first)
    return (a.second.first < b.second.first);
  else if (a.second.first == b.second.first)
    return (a.second.second < b.second.second);
  return (a.first < b.first);
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  vector<pair<long long, long long>> v;
  long long ans = -1, f = 0;
  long long x;
  if (k % 2)
    x = (k + 2) / 2;
  else
    x = k / 2;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    v.push_back({a[i], i + 1});
    if (a[i] >= x && a[i] <= k) ans = i;
    if (a[i] <= k) f = 1;
  }
  if (f == 0) {
    cout << -1 << '\n';
    return;
  }
  if (ans != -1) {
    cout << 1 << '\n';
    cout << ans + 1 << '\n';
    return;
  }
  long long cur = 0;
  sort(v.begin(), v.end());
  long long ind = 0;
  for (ind = 0; ind < n; ind++) {
    if (v[ind].first >= k) break;
  }
  vector<pair<long long, long long>> vec;
  for (long long i = ind - 1; i >= 0; i--) {
    if (cur >= x) break;
    cur += v[i].first;
    vec.push_back(v[i]);
  }
  if (cur < x || cur > k || vec.size() == 0) {
    cout << -1 << '\n';
    return;
  }
  sort(vec.begin(), vec.end());
  cout << vec.size() << '\n';
  for (auto it : vec) cout << it.second << " ";
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
