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.
import java.io.*;
import java.util.*;
import java.math.*;

 
 public class Main	{
   static class Pair implements Comparable<Pair>{
   int a;
   int b;
   public Pair(int x,int y){a=Math.min(x, y);b=Math.max(x, y);}
   public Pair(){}
   public int compareTo(Pair p){
	 return p.a - a;
   }
@Override
public int hashCode() {
	final int prime = 31;
	int result = 1;
	result = prime * result + a;
	result = prime * result + b;
//	out.println("hashcode = "+result);
	return result;
}
@Override
public boolean equals(Object obj) {
	Pair cur = (Pair)obj;
	if((a==cur.a && b==cur.b) || (a==cur.b && b==cur.a))return true;
	return false;
}
 }
   static class cell implements Comparable<cell>{
	   int a,b;
	   long dis;
	   public cell(int x,int y,long z) {a=x;b=y;dis=z;}
	   public int compareTo(cell c) {
		   return Long.compare(dis,c.dis);
	   }
   }
static class TrieNode{
	TrieNode left;
	TrieNode right;
	int op;
	int data;
	public TrieNode() {}
}
  public static int gcd(int a,int b)
  {
    if(a<b)

      return gcd(b,a);
    if(b==0)
      return a;
    return gcd(b,a%b);
    
  }
  static long lcm(int a,int b) {
	  return  a*b / gcd(a,b);
  }
  //static long ans = 0;
  static long mod = 998244353;//(long)(1e9+7);//
   
    public static void main(String[] args) throws Exception {
       new Thread(null, null, "Anshum Gupta", 99999999) {
            public void run() {
                try {
                    solve();
                } catch(Exception e) {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }

static long pow(long x,long y){
    if(y == 0)return 1;
    if(y==1)return x;
    long a = pow(x,y/2);
    a = (a*a)%mod;
    if(y%2==0){
        return a;
    }
    return (a*x)%mod;
}

static long mxx;
static int mxN = (int)(1e7);
static long[]fact,inv_fact;
static long my_inv(long a) {
	return pow(a,mod-2);
}
static long bin(int a,int b) {
	if(a < b || a<0 || b<0)return 0;
    return ((fact[a]*inv_fact[a-b])%mod * inv_fact[b])%mod;
}
//static ArrayList<ArrayList<Integer>>adj;
//static boolean[]vis;
static void make_facts() {
  fact=new long[mxN];
  inv_fact = new long[mxN];
  fact[0]=inv_fact[0]=1L;
  for(int i=1;i<mxN;i++) {
	   fact[i] = (i*fact[i-1])%mod;
	   inv_fact[i] = my_inv(fact[i]);
  }
}
//static int[]bfs(int a){
//	Queue<Integer> q = new  LinkedList<Integer>();
//	
//	vis = new boolean[n+1];
//	int[]dis = new int[n+1];
//	q.add(a);
//	dis[a] = 0;
//	vis[a] = true;
//	while(!q.isEmpty()) {
//		int cur = q.poll();
//	//	vis[cur] = true;
//	//	if(cur == b)break;
//		for(int x : adj.get(cur)) {
//			if(vis[x])continue;
//			q.add(x);
//			dis[x] = dis[cur]+1;
//			vis[x] = true;
//		}
//	}
//	return dis;
//}

 public static void solve() throws Exception {
   // solve the problem here
   MyScanner s = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        int tc = s.nextInt();
        mxx = (long)(1e18+5);
//        make_facts();  
        while(tc-->0){
        	int n = s.nextInt();
        	int x = s.nextInt();
            int[]a=new int[n];
            int sum = 0;
            for(int i=0;i<n;++i) {
            	a[i]=s.nextInt();
            	sum += a[i];
            }
            int ans = 0;
            int i = 0, j = n-1;
            
            	int z = i;
            	int y = j;
            	int temp = sum;
            	if(sum % x != 0) {
            		ans = j - i + 1;
            	}
            	while(i<n && a[i] % x == 0) {
            		sum -= a[i++];
            	}
            	if(i < n) {
            		sum -= a[i++];
            	}
            	if(sum % x != 0)
             	ans = Math.max(ans, j-i+1);
            	i = z;
            	sum = temp;
            	
            	while(j>=0 && a[j]%x==0) {
            		sum -= a[j--];
            	}
            	if(j >= 0) {
            		sum -= a[j--];
            	}
            	if(sum % x != 0)
             	ans = Math.max(ans, j-i+1);
            
            
            out.println(ans == 0 ?"-1":ans);
        }
        	
           
        out.flush();
}
 
     
 
 
 
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
 
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
         
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    //--------------------------------------------------------
}
