Problem: You have a knapsack with the capacity of W. There are also n items, the i-th one has weight w_i. 

You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) does not exceed it. Formally, C should satisfy: ⌈ W/2⌉ ≤ C ≤ W. 

Output the list of items you will put into the knapsack or determine that fulfilling the conditions is impossible. 

If there are several possible lists of items satisfying the conditions, you can output any. Note that you don't have to maximize the sum of weights of items in the knapsack.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^4). Description of the test cases follows.

The first line of each test case contains integers n and W (1 ≤ n ≤ 200 000, 1≤ W ≤ 10^{18}). 

The second line of each test case contains n integers w_1, w_2, ..., w_n (1 ≤ w_i ≤ 10^9) — weights of the items.

The sum of n over all test cases does not exceed 200 000.

Output

For each test case, if there is no solution, print a single integer -1. 

If there exists a solution consisting of m items, print m in the first line of the output and m integers j_1, j_2, ..., j_m (1 ≤ j_i ≤ n, all j_i are distinct) in the second line of the output — indices of the items you would like to pack into the knapsack.

If there are several possible lists of items satisfying the conditions, you can output any. Note that you don't have to maximize the sum of weights items in the knapsack.

Example

Input


3
1 3
3
6 2
19 8 19 69 9 4
7 12
1 1 1 17 1 1 1


Output


1
1
-1
6
1 2 3 5 6 7

Note

In the first test case, you can take the item of weight 3 and fill the knapsack just right.

In the second test case, all the items are larger than the knapsack's capacity. Therefore, the answer is -1.

In the third test case, you fill the knapsack exactly in half.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MOD = 1e9 + 7;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t-- > 0) {
    ll n, W;
    cin >> n >> W;
    ll lower_bound = ceil(W / 2.0);
    ll upper_bound = W;
    vector<pair<ll, ll> > w(n);
    for (int i = 0; i < int(n); i++) {
      ll temp;
      cin >> temp;
      w[i] = {temp, i};
    }
    sort(w.begin(), w.end());
    if (w[0].first > W)
      cout << -1 << '\n';
    else {
      bool found = false;
      for (auto i : w) {
        if (i.first >= lower_bound && i.first <= upper_bound) {
          cout << 1 << '\n';
          cout << i.second + 1 << '\n';
          found = true;
          break;
        }
      }
      if (found) {
        continue;
      } else {
        vector<pair<ll, ll> > new_w;
        for (auto i : w) {
          if (i.first > upper_bound)
            break;
          else
            new_w.push_back(i);
        }
        if (new_w.empty()) {
          cout << -1 << '\n';
        } else {
          vector<ll> prefix;
          prefix.push_back(new_w[0].first);
          for (int i = 1; i < new_w.size(); i++)
            prefix.push_back(prefix[prefix.size() - 1] + new_w[i].first);
          for (int i = 0; i < prefix.size(); i++) {
            if (prefix[i] >= lower_bound && prefix[i] <= upper_bound) {
              cout << i + 1 << '\n';
              for (int j = 0; j <= i; j++) cout << new_w[j].second + 1 << ' ';
              cout << '\n';
              found = true;
              break;
            }
          }
          if (!found) {
            cout << -1 << '\n';
          }
        }
      }
    }
  }
}