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 JAVA):

Solution:

import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;


public class N702 {
	static PrintWriter out;
	static Scanner sc;
	static ArrayList<Integer>q,w,primes;
	static ArrayList<Integer>adj[];
	static HashSet<Integer>primesH;
	static boolean prime[];
	//static ArrayList<Integer>a;
	static HashSet<Long>h,tmp;
	static boolean[]vis;
	static int[]a,b,c,d;
	static int[][] dp;
	static int dr[][];
	static int A,B,n,m,k,mt[][];
	static int oo=Integer.MIN_VALUE;
	static String s,tt;
	public static void main(String[]args) throws IOException {
		sc=new Scanner(System.in);
		out=new PrintWriter(System.out);
		//A();
    //	B();
		//primes=new ArrayList<Integer>();
		//primesH=new HashSet<Integer>();
	//	sieveOfEratosthenes(50);
		//C();
		//D();
		E();
//		for(int i=0;i<1000;i++) {
//			out.print("1000000000 ");
//		}
//		out.println();
		//minimum for subarrays of fixed length
		//F();
		out.close();
	}
	  private static void A() throws IOException {
		  int t=ni();
			while(t-->0) {
				int n=ni();
				a=nai(n);
				long ans=0;
				for(int i=0;i<n-1;i++) {
					int mx=Math.max(a[i], a[i+1]);
					int mn=Math.min(a[i], a[i+1]);
					if(mx<=2*mn)continue;
					int cur=(int)Math.ceil(mx/2.0);
					ans++;
					while(cur>2*mn) {
						ans++;
						cur=(int)Math.ceil(cur/2.0);
					}
				}
				out.println(ans);
			}
		
	   }
		static void B() throws IOException {
			int t=ni();
			while(t-->0) {
				int n=ni();
				a=nai(n);
				int[]c=new int[3];
				for(int i=0;i<n;i++) {
					c[a[i]%3]++;
				}
				int v=n/3,ans=0;
				for(int i=0;i<3;i++) {
					if(c[i]>v) {
						ans+=(c[i]-v);
						c[(i+1)%3]+=(c[i]-v);
						c[i]=v;

					}
				}
				for(int i=0;i<3;i++) {
					if(c[i]>v) {
						ans+=(c[i]-v);
						c[(i+1)%3]+=(c[i]-v);
						c[i]=v;

					}
				}
				for(int i=0;i<3;i++) {
					if(c[i]>v) {
						ans+=(c[i]-v);
						c[(i+1)%3]+=(c[i]-v);
						c[i]=v;

					}
				}
				out.println(ans);
						
			}
		}
		static void B2() throws IOException {
			 int t=ni();
			  while(t-->0) {
				  int n=ni(),k=ni();
					int[]pt=new int[2*n];
					boolean dec=true;
					for(int i=0,cnt=n;i<pt.length;i++) {
						pt[i]=cnt;
						cnt--;
						if(cnt==0)cnt=n;
					}
					//disp(pt);
					if(n%2==0) {
						out.println(k%n==0?n:k%n);
					}
					else {
					
							int[]pt2=new int[n*n+1];
							dec=false;
							for(int i=0,cnt=1;i<pt2.length;i++) {
								if(cnt==pt[i%n]) {
									cnt++;
								}
								pt2[i]=cnt;
								cnt++;
								if(cnt>=n) {
									cnt=1;
								}
								
								
							}
							
							out.println(pt2[(k-1)%(2*n)]);
					}
				  
				  
			  }
		}
	  static void C() throws IOException {
		  int t=ni();
		  while(t-->0) {
			  long n=sc.nextLong();
			
			  long lrg=1;
			  for(;lrg*lrg*lrg*1l<=n;lrg++) {
				 // out.println("ji");
			  }
	
			  
			  long[] pows=new long[((int)lrg)+1];
			  for(long i=1;i<pows.length;i++) {
				  pows[(int)i]=i*i*i*1l;
			  }
			//  disp(pows);
			  boolean f=false;
			  for(;lrg>0&&!f;lrg--) {
				  long trgt=n-lrg*lrg*lrg*1l;
				  if(trgt<=0)continue;
				  int lo=0,hi=pows.length-1;
				  while(lo<=hi) {
					  int mid=(lo+hi)/2;
					  if(pows[mid]==trgt) {
						  f=true;
						  break;
					  }else if(pows[mid]<trgt) {
						  lo=mid+1;
					  }else {
						  hi=mid-1;
					  }
			  }
			  }
			  out.println(f?"YES":"NO");
		  }
			
		  
		  
		}



	static void D() throws IOException {
		int t=ni();
		while(t-->0) {
			n=ni();
			a=nai(n);
			vis=new boolean[n];
			d=new int[n];
	
			dfs(get(0,1,Integer.MAX_VALUE));
			for(int x:d) {
				out.print(x+" ");
			}
			out.println();
		}
		
		
		
	}
	private static void dfs(int u) {
		vis[u]=true;
		int left=get(u-1,0,a[u]);
		int right=get(u+1,1,a[u]);
		if(left!=-1) {
			d[left]=d[u]+1;
			dfs(left);
			
		}
		if(right!=-1) {
			d[right]=d[u]+1;
			dfs(right);
			
		}
	}
	static int get(int x,int y,int cur) {
		int max=0,maxIdx=-1;
		if(y==1) {
		for(int i=x;i<n;i++) {
			if(vis[i])break;
			if(a[i]>max&&a[i]<cur) {
				max=a[i];
				maxIdx=i;
			}
		}
		}else {
			for(int i=x;i>=0;i--) {
				if(vis[i])break;
				if(a[i]>max&&a[i]<cur) {
					max=a[i];
					maxIdx=i;
				}
			}
		}
		return maxIdx;
	}
	private static int sum(char[] ss) {
		int sum=0;
		for(int i=0;i<ss.length;i++) {
			sum+=(ss[i]-'0');
		}
		return sum;
	}
	static int gcd (int a, int b) {
	    return b==0?a:gcd (b, a % b);
	}
	static int lcm (int a, int b) {
	    return a / gcd(a, b) * b;
	}
	static void E() throws IOException {
		int t=ni();
		while(t-->0) {
			n=ni();
			a=nai(n);
			int[]tmp=new int[n];
			for(int i=0;i<n;i++)tmp[i]=a[i];
			HashSet<Long>ans=new HashSet<Long>();
			ruffleSort(tmp);
			long sum=0;
			int i=0,ii=0;
			for(;i<n;i++) {
				if(tmp[i]>sum)ii=i;
				sum+=tmp[i];				
			}
			for(;ii<n;ii++) {
				ans.add((long) tmp[ii]);
			}
			StringBuilder sb=new StringBuilder();
			int len=0;
			for(i=0;i<n;i++) {
				if(ans.contains((long)a[i])) {
					sb.append((i+1)+" ");
					len++;
				}
			}
			out.println(len);
			out.println(sb);
			
		}
		
		
		
	}
	static final Random random=new Random();
	static void ruffleSort(int[] a) {
		int n=a.length;//shuffle, then sort 
		for (int i=0; i<n; i++) {
			int oi=random.nextInt(n), temp=a[oi];
			a[oi]=a[i]; a[i]=temp;
		}
		Arrays.sort(a);
	}
	static void F() throws IOException{
		int t=1;
		while(t-->0) {
			
		}
		
	}


	
	static void G() throws IOException{
		int t=1;
		while(t-->0) {

			
			
			
		}
		
	}
	private static void disp(long[] pows) {
		for(int i=0;i<pows.length;i++) {
			out.print(pows[i]+" ");
		}
		out.println();
	}

	static int ni() throws IOException {
		return sc.nextInt();
	}
	static double nd() throws IOException {
		return sc.nextDouble();
	}
	static long nl() throws IOException {
		return  sc.nextLong();
	}
	static String ns() throws IOException {
		return sc.next();
	}
	static int[] nai(int n) throws IOException {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = sc.nextInt();
		return a;
	}
	static long[] nal(int n) throws IOException {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = sc.nextLong();
		return a;
	}
	static int[][] nmi(int n,int m) throws IOException{
		int[][]a=new int[n][m];
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				a[i][j]=sc.nextInt();
			}
		}
		return a;
	}

	static long[][] nml(int n,int m) throws IOException{
		long[][]a=new long[n][m];
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				a[i][j]=sc.nextLong();
			}
		}
		return a;
	}
	static void o(String x) {
		out.print(x);
	}
	static void ol(String x) {
		out.println(x);
	}
	static void ol(int x) {
		out.println(x);
	}
	static void disp1(int []a) {
		for(int i=0;i<a.length;i++) {
			out.print(a[i]+" ");
		}
		out.println();
	}

	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public boolean hasNext() {return st.hasMoreTokens();}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		
		public double nextDouble() throws IOException {return Double.parseDouble(next());}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}
			
		public boolean ready() throws IOException {return br.ready(); }
		

	}
}