#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > a;
long long t, n, w, sum;
int temp;
int main() {
  scanf("%lld", &t);
  while (t--) {
    a.clear();
    scanf("%lld %lld", &n, &w);
    sum = 0;
    long long lll = ceil(w / 2.0);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &temp);
      a.push_back({temp, i});
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < a.size(); i++) {
      sum += a[i].first;
      if (sum >= lll && sum <= w) {
        printf("%d\n", i + 1);
        for (int j = 0; j <= i; j++) printf("%d ", a[j].second);
        printf("\n");
        break;
      }
      if (sum > w) {
        if (a[i].first >= lll && a[i].first <= w)
          printf("1\n%d\n", a[i].second);
        else
          printf("-1\n");
        break;
      }
    }
    if (sum < lll) printf("-1\n");
  }
  return 0;
}
