#include <bits/stdc++.h>
using namespace std;
long long int add(long long int a, long long int b) {
  return ((a % 1000000007) + (b % 1000000007)) % 1000000007;
}
long long int mul(long long int a, long long int b) {
  return ((a % 1000000007) * (b % 1000000007)) % 1000000007;
}
long long int sub(long long int a, long long int b) {
  long long int curr = ((a % 1000000007) - (b % 1000000007)) % 1000000007;
  if (curr < 0) curr += 1000000007;
  return curr;
}
long long int power(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  long long int res = power(a, b / 2);
  res = res * res;
  if (b % 2) res = res * a;
  return res;
}
void solve() {
  int n;
  cin >> n;
  long long int w;
  cin >> w;
  pair<long long int, int> arr[n];
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    arr[i] = {x, i + 1};
  }
  sort(arr, arr + n);
  vector<int> ans;
  long long int pre = 0;
  for (int i = 0; i < n; i++) {
    if (arr[i].first >= (w + 1) / 2 && arr[i].first <= w) {
      cout << 1 << endl;
      cout << arr[i].second << endl;
      return;
    } else if (arr[i].first > w)
      break;
    pre += arr[i].first;
    ans.push_back(arr[i].second);
    if (pre >= (w + 1) / 2) break;
  }
  if (pre < (w + 1) / 2) {
    cout << -1 << endl;
    return;
  }
  cout << ans.size() << endl;
  for (auto x : ans) cout << x << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
