#include <bits/stdc++.h>
using namespace std;
void print(queue<pair<long long, long long>> q) {
  vector<long long> answer;
  long long cnt{0};
  while (!q.empty()) {
    pair<long long, long long> temp = q.front();
    answer.push_back(temp.second);
    q.pop();
    cnt++;
  }
  if (cnt == 0) {
    cout << -1 << '\n';
    return;
  }
  cout << cnt << '\n';
  for (long long i = 0; i < answer.size(); i++) cout << answer[i] << " ";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t{0};
  cin >> t;
  while (t--) {
    long long n{0};
    long long w{0};
    cin >> n >> w;
    long long half{0};
    if (w % 2 == 0)
      half = w / 2;
    else
      half = (w / 2) + 1;
    long long arr[n + 1];
    for (long long i = 1; i <= n; i++) cin >> arr[i];
    vector<pair<long long, long long>> vect;
    for (long long i = 1; i <= n; i++) {
      pair<long long, long long> temp;
      temp.first = arr[i];
      temp.second = i;
      vect.push_back(temp);
    }
    sort(vect.begin(), vect.end());
    long long sum{0};
    queue<pair<long long, long long>> q;
    for (long long i = 0; i < vect.size(); i++) {
      sum = sum + vect[i].first;
      q.push(vect[i]);
      if (sum >= half && sum <= w) {
        break;
      } else if (sum > w) {
        break;
      }
    }
    if (sum >= half && sum <= w) {
      print(q);
    } else if (sum > w) {
      while (!q.empty()) {
        pair<long long, long long> temp = q.front();
        sum = sum - temp.first;
        q.pop();
        if (sum >= half && sum <= w) {
          break;
        }
      }
      if (sum >= half && sum <= w)
        print(q);
      else
        cout << -1 << '\n';
    } else {
      cout << -1 << '\n';
    }
  }
  return 0;
}
