#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n;
long long w;
pair<int, int> a[N];
void solve() {
  cin >> n >> w;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].first);
    a[i].second = i;
  }
  sort(a + 1, a + n + 1);
  long long sum = 0;
  vector<int> bag;
  for (int i = n; i >= 1; i--) {
    if (sum + a[i].first <= w) {
      sum += a[i].first;
      bag.push_back(a[i].second);
    }
  }
  if (sum * 2 >= w) {
    printf("%d\n", (int)bag.size());
    sort(bag.begin(), bag.end());
    for (auto x : bag) {
      printf("%d ", x);
    }
    puts("");
  } else {
    puts("-1");
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
