#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, arr[N];
long long w;
int main() {
  int t;
  cin >> t;
  while (t--) {
    scanf("%d%lld", &n, &w);
    for (int i = 0; i < n; i++) {
      scanf("%d", &arr[i]);
    }
    vector<int> ans;
    long long sum = 0;
    for (int i = 0; i < n && sum < (w + 1) / 2; i++) {
      if ((long long)arr[i] >= (w + 1) / 2 && (long long)arr[i] <= w) {
        ans.clear();
        sum = arr[i];
        ans.push_back(i);
        break;
      }
      if (arr[i] < (w + 1) / 2) {
        sum += arr[i];
        ans.push_back(i);
      }
    }
    if (sum >= (w + 1) / 2) {
      printf("%d\n", (int)ans.size());
      for (int i = 0; i < (int)ans.size(); i++) {
        if (i) putchar(' ');
        printf("%d", ans[i] + 1);
      }
      puts("");
    } else
      puts("-1");
  }
  return 0;
}
