Problem: Ehab loves number theory, but for some reason he hates the number x. Given an array a, find the length of its longest subarray such that the sum of its elements isn't divisible by x, or determine that such subarray doesn't exist.

An array a is a subarray of an array b if a can be obtained from b by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Input

The first line contains an integer t (1 ≤ t ≤ 5) — the number of test cases you need to solve. The description of the test cases follows.

The first line of each test case contains 2 integers n and x (1 ≤ n ≤ 10^5, 1 ≤ x ≤ 10^4) — the number of elements in the array a and the number that Ehab hates.

The second line contains n space-separated integers a_1, a_2, …, a_{n} (0 ≤ a_i ≤ 10^4) — the elements of the array a.

Output

For each testcase, print the length of the longest subarray whose sum isn't divisible by x. If there's no such subarray, print -1.

Example

Input


3
3 3
1 2 3
3 4
1 2 3
2 2
0 6


Output


2
3
-1

Note

In the first test case, the subarray [2,3] has sum of elements 5, which isn't divisible by 3.

In the second test case, the sum of elements of the whole array is 6, which isn't divisible by 4.

In the third test case, all subarrays have an even sum, so the answer is -1.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
public class Main{
	
	//make it false if Multiple test case is not in the question
	static boolean multipleTC = true;
	
	//for pre processing if needed
	void pre() throws Exception
	{}
		public static void main(String[] args) throws Exception{
			
		new Main().run();
	  }
	  



	// input output handled here
	private String in_out(int tc) throws Exception{
		 int n=ni();
		 int x=ni();

		 long sum=0,start=-1,end=0;
		 //int[] arr=new int[n];
		 for(int i=0;i<n;i++){
			int a=ni();
			if(a%x!=0)
			{
				if(start==-1)
				start=i;
				end=i;
			}
			sum+=a;
		 }
		 if(sum%x!=0)
		 return ""+n;
		 else if(start==-1)
		 return "-1";
		 else
		 return ""+(n-Math.min(start+1,n-end));
		
		

	}
	

	

	
	
	void run() throws Exception{
	//	long start_time=System.nanoTime();

		//in = new FastReader("input.txt");  out = new PrintWriter("output.txt");
		in = new FastReader(); out = new PrintWriter(System.out);
		


		StringBuilder print=new StringBuilder("");
		pre();
		int T = (multipleTC)?ni():1;
		for(int t = 1; t<= T; t++){
		print.append(in_out(t)).append("\n");
		}

		p(print);
		//long end_time=System.nanoTime();
		//System.out.println("Running Time in nano sec : "+(end_time-start_time));
		
		out.flush();
		out.close();
	}
	
	PrintWriter out;
		FastReader in;
		
			void p(Object o)
				{out.print(o);}
			void pln(Object o)
				{out.println(o);}
			void pnf(Object o)
				{out.println(o);
				out.flush();}
		
			String n()throws Exception
				{return in.readLine();}
		
			String nln()throws Exception
				{return in.readLine();}
		
			int ni()throws Exception
				{return (in.nextInt());}
		
			long nl()throws Exception
				{return in.nextLong();}
		
			double nd()throws Exception
				{return in.nextDouble();}
	
				static class FastReader 
				{ 
					final private int BUFFER_SIZE = 1 << 16; 
					private DataInputStream din; 
					private byte[] buffer; 
					private int bufferPointer, bytesRead; 
			  
					public FastReader() 
					{ 
						din = new DataInputStream(System.in); 
						buffer = new byte[BUFFER_SIZE]; 
						bufferPointer = bytesRead = 0; 
					} 
			  
					public FastReader(String file_name) throws IOException 
					{ 
						din = new DataInputStream(new FileInputStream(file_name)); 
						buffer = new byte[BUFFER_SIZE]; 
						bufferPointer = bytesRead = 0; 
					} 
			  
					public String readLine() throws IOException 
					{ 
						byte[] buf = new byte[64]; // line length 
						int cnt = 0, c; 
						while ((c = read()) != -1) 
						{ 
							if (c == '\n') 
								break; 
							buf[cnt++] = (byte) c; 
						} 
						return new String(buf, 0, cnt); 
					} 
			  
					public int nextInt() throws IOException 
					{ 
						int ret = 0; 
						byte c = read(); 
						while (c <= ' ') 
							c = read(); 
						boolean neg = (c == '-'); 
						if (neg) 
							c = read(); 
						do
						{ 
							ret = ret * 10 + c - '0'; 
						}  while ((c = read()) >= '0' && c <= '9'); 
			  
						if (neg) 
							return -ret; 
						return ret; 
					} 
			  
					public long nextLong() throws IOException 
					{ 
						long ret = 0; 
						byte c = read(); 
						while (c <= ' ') 
							c = read(); 
						boolean neg = (c == '-'); 
						if (neg) 
							c = read(); 
						do { 
							ret = ret * 10 + c - '0'; 
						} 
						while ((c = read()) >= '0' && c <= '9'); 
						if (neg) 
							return -ret; 
						return ret; 
					} 
			  
					public double nextDouble() throws IOException 
					{ 
						double ret = 0, div = 1; 
						byte c = read(); 
						while (c <= ' ') 
							c = read(); 
						boolean neg = (c == '-'); 
						if (neg) 
							c = read(); 
			  
						do { 
							ret = ret * 10 + c - '0'; 
						} 
						while ((c = read()) >= '0' && c <= '9'); 
			  
						if (c == '.') 
						{ 
							while ((c = read()) >= '0' && c <= '9') 
							{ 
								ret += (c - '0') / (div *= 10); 
							} 
						} 
			  
						if (neg) 
							return -ret; 
						return ret; 
					} 
			  
					private void fillBuffer() throws IOException 
					{ 
						bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
						if (bytesRead == -1) 
							buffer[0] = -1; 
					} 
			  
					private byte read() throws IOException 
					{ 
						if (bufferPointer == bytesRead) 
							fillBuffer(); 
						return buffer[bufferPointer++]; 
					} 
			  
					public void close() throws IOException 
					{ 
						if (din == null) 
							return; 
						din.close(); 
					} 
				} 
}