#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MAX = 2e9;
const double PI = acos(-1);
vector<pair<ll, int>> w;
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int T;
  cin >> T;
  while (T--) {
    ll sum = 0;
    int n;
    ll W;
    cin >> n >> W;
    w.clear();
    for (int i = 1; i <= n; i++) {
      ll a;
      cin >> a;
      w.push_back({a, i});
      sum += a;
    }
    vector<int> ans;
    sort(w.begin(), w.end());
    if (w[0].first > W)
      cout << -1 << '\n';
    else if (sum < (W + 1) / 2)
      cout << -1 << '\n';
    else {
      bool check = false;
      for (int i = 0; i < (int)w.size(); i++) {
        if (w[i].first >= (W + 1) / 2 && w[i].first <= W) {
          ans.push_back(w[i].second);
          check = true;
          break;
        }
      }
      ll tmp = 0;
      if (check == false) {
        for (int i = 0; i < (int)w.size(); i++) {
          ans.push_back(w[i].second);
          tmp += w[i].first;
          if (tmp >= (W + 1) / 2) break;
        }
      }
      if (tmp > W)
        cout << -1 << '\n';
      else {
        cout << (int)ans.size() << '\n';
        for (int i : ans) cout << i << ' ';
        cout << '\n';
      }
    }
  }
}
