Problem: A championship is held in Berland, in which n players participate. The player with the number i has a_i (a_i ≥ 1) tokens.

The championship consists of n-1 games, which are played according to the following rules:

  * in each game, two random players with non-zero tokens are selected; 
  * the player with more tokens is considered the winner of the game (in case of a tie, the winner is chosen randomly); 
  * the winning player takes all of the loser's tokens; 



The last player with non-zero tokens is the winner of the championship.

All random decisions that are made during the championship are made equally probable and independently.

For example, if n=4, a = [1, 2, 4, 3], then one of the options for the game (there could be other options) is: 

  * during the first game, the first and fourth players were selected. The fourth player has more tokens, so he takes the first player's tokens. Now a = [0, 2, 4, 4]; 
  * during the second game, the fourth and third players were selected. They have the same number of tokens, but in a random way, the third player is the winner. Now a = [0, 2, 8, 0]; 
  * during the third game, the second and third players were selected. The third player has more tokens, so he takes the second player's tokens. Now a = [0, 0, 10, 0]; 
  * the third player is declared the winner of the championship. 



Championship winners will receive personalized prizes. Therefore, the judges want to know in advance which players have a chance of winning, i.e have a non-zero probability of winning the championship. You have been asked to find all such players. 

Input

The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

The first line of each test case consists of one positive integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of players in the championship.

The second line of each test case contains n positive integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — the number of tokens the players have.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5. 

Output

For each test case, print the number of players who have a nonzero probability of winning the championship. On the next line print the numbers of these players in increasing order. Players are numbered starting from one in the order in which they appear in the input. 

Example

Input


2
4
1 2 4 3
5
1 1 1 1 1


Output


3
2 3 4 
5
1 2 3 4 5 

Solution (in CPP):

Solution:
#pragma GCC optimize("O2")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops,fast-math")

#define ll long long 
#define u unsigned
#define frr(x,y) for(int y=0;y<x;y++)
#define fr(x) frr(x,i)
#define frin fr(n)

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <map>
#include <set>
#include <queue>

using namespace std;

ll n, m, k, t, x, y, z, a, b, c, d, l, r;
vector<int> f, p, dp;

int getmax(int l, int r)
{
	int ans = 0,mx=0;
	for (int i = l; i <= r; i++)
	{
		if (f[i] > mx)
		{
			mx = f[i];
			ans = i;
		}
	}
	return ans;
}

void bld(int l, int r, int d)
{
	if (r < l)
		return;
	int v = getmax(l, r);
	p[v] = d;
	bld(l, v - 1,d+1);
	bld(v + 1, r, d + 1);
}

void solve()
{
	cin >> n;
	vector<pair<ll, ll>>f;
	vector<ll>ans;
	vector<ll>p;
	frin
	{
		cin >> a;
	f.push_back({ a,i });
	}
	sort(f.begin(), f.end());
	p.push_back(f[0].first);
	fr(n - 1)
	{
		p.push_back(p[i] + f[i + 1].first);
	}
	ans.push_back(f[n - 1].second);
	for (int i = n - 2; i >= 0; i--)
	{
		if (p[i] >= f[i + 1].first)
			ans.push_back(f[i].second);
		else
			break;
	}
	sort(ans.begin(), ans.end());
	cout << ans.size() << "\n";
	for (auto& x : ans)
	{
		cout << x + 1 << " ";
	}
	cout << "\n";
}

int main()
{
	cin.tie();
	cout.tie();
	ios::sync_with_stdio(0);
	cin >> t;
	while (t--)
	{
		solve();
	}
}