#include <bits/stdc++.h>
using LL = long long;
using namespace std;
int T, n, a[200010];
vector<int> ans;
LL w;
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d%lld", &n, &w);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    LL s = 0;
    int i;
    ans.clear();
    for (i = 1; i <= n; i++)
      if (a[i] <= w) {
        if (s + a[i] <= w) {
          s += a[i];
          ans.push_back(i);
        } else
          break;
        if (s >= (w + 1) / 2) break;
      }
    if (i > n)
      puts("-1");
    else if (s < (w + 1) / 2)
      printf("1\n%d\n", i);
    else {
      printf("%d\n", ans.size());
      for (auto x : ans) printf("%d ", x);
      puts("");
    }
  }
  return 0;
}
