#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int w;
    cin >> w;
    vector<pair<long long int, long long int>> v;
    long long int sum = 0;
    for (int i = 0; i < n; i++) {
      long long int x;
      cin >> x;
      sum += x;
      v.push_back({x, i + 1});
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    long long int xu = w / 2;
    xu = w - xu;
    int count = 0;
    for (int i = 0; i < n; i++) {
      long long int newT = sum - v[i].first;
      if (xu <= newT and newT <= w) {
        sum = newT;
        v[i].first = -1;
        count++;
        break;
      } else if (newT > w) {
        sum = newT;
        v[i].first = -1;
        count++;
      }
    }
    if (!(xu <= sum and sum <= w)) {
      cout << -1 << "\n";
      continue;
    } else {
      cout << n - count << "\n";
      for (int i = 0; i < n; i++) {
        if (v[i].first != -1) {
          cout << v[i].second << " ";
        }
      }
      cout << "\n";
    }
  }
}
