#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10, inf = 1e9;
const long double pi = 3.14159265;
long long n, w, a[maxn], t, b[maxn];
vector<long long> ans;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> w;
    ans.clear();
    bool check = false;
    long long index;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      if (a[i] >= (w + 1) / 2 && a[i] <= w) check = 1, index = i;
    }
    if (check == 1) {
      cout << 1 << endl << index << endl;
      continue;
    }
    long long sum = 0;
    for (int i = 1; i <= n; i++) {
      if (sum + a[i] <= w) {
        sum += a[i];
        ans.push_back(i);
      }
    }
    if (sum < (w + 1) / 2) {
      cout << -1 << endl;
      continue;
    }
    cout << ans.size() << endl;
    for (auto x : ans) {
      cout << x << " ";
    }
    cout << endl;
  }
  return 0;
}
