#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005;
const long long Mod = 998244353;
struct node {
  long long w, id;
} a[maxn];
bool cmp(node a, node b) { return a.w < b.w; }
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  int t;
  int n;
  cin >> t;
  long long R, L;
  while (t--) {
    cin >> n >> R;
    L = (R + 1ll) / 2ll;
    for (int i = 1; i <= n; i++) {
      cin >> a[i].w;
      a[i].id = i;
    }
    sort(a + 1, a + n + 1, cmp);
    int f = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i].w >= L && a[i].w <= R) {
        cout << 1 << endl;
        cout << a[i].id << endl;
        f = 1;
        break;
      }
    }
    if (f) continue;
    long long sum = 0, pos = n;
    for (int i = 1; i <= n; i++) {
      sum += a[i].w;
      if (sum >= L) {
        pos = i;
        break;
      }
    }
    if (sum < L || sum > R) {
      cout << -1 << endl;
      continue;
    }
    cout << pos << endl;
    for (int i = 1; i <= pos; i++) cout << a[i].id << ' ';
    cout << endl;
  }
  return 0;
}
