#include <bits/stdc++.h>
using namespace std;
void iofun() {}
long long Pow(long long c, long long d) {
  return d == 0 ? 1 : c * pow(c, d - 1);
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
void solve() {
  int n, k, c = 0;
  long long w, sum = 0, sum1 = 0;
  cin >> n >> w;
  long long a[n + 10];
  vector<pair<long long, int>> mp;
  vector<int> pos;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    mp.push_back({a[i], i});
    sum += a[i];
  }
  sort(mp.begin(), mp.end());
  long long limit;
  limit = (w + 1) / 2;
  multimap<long long, int>::iterator itr;
  if (sum < limit || mp[0].first > w) {
    cout << "-1\n";
    return;
  } else {
    long long x = w;
    for (int i = mp.size() - 1; i >= 0; --i) {
      while (mp[i].first > x && i >= 0) i--;
      if (i >= 0) {
        sum1 += mp[i].first;
        pos.push_back(mp[i].second);
        x = x - mp[i].first;
      }
    }
    if (sum1 >= limit && sum1 <= w) {
      cout << pos.size() << endl;
      for (int i = 0; i < pos.size(); ++i) {
        cout << pos[i] << ' ';
      }
      cout << endl;
    } else
      cout << "-1\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  iofun();
  long long tc;
  cin >> tc;
  while (tc--) {
    solve();
  };
  return 0;
}
