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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;

public final class CodeForces648A {
    static int x;
    static HashMap<String,Integer> mem;
    public static void main(String args[]){
        FastReader sc=new FastReader(); 
        PrintWriter out = new PrintWriter(System.out);
        int t = sc.nextInt();
        for(int i=0;i<t;i++){
            int n = sc.nextInt();
            x = sc.nextInt();
            //mem = new HashMap<>();
            long a[] = new long[n];
            long sum = 0;
            int first = -1,last = -1;
            for(int j=0;j<n;j++){
                a[j] = sc.nextInt();
                sum +=a[j];
            }
            
            for(int j=0;j<n;j++){
                if((a[j]%x)!=0){
                    first = j;
                    break;
                }
            }
            
            for(int j=n-1;j>=0;j--){
                if(a[j]%x!=0){
                    last = j;
                    break;
                }
            }
            
            //System.out.println(first+" "+last);
            if((sum%x)!=0){
                System.out.println(n);
            }
            else if(first==-1){
                System.out.println("-1");
            }
            else{
                long ans = Math.max(n-first-1,last);
                System.out.println(ans);
            }
        }
        out.flush();
        out.close();
    }
    
        static int findAns(long arr[],  
                                      int n, int k) 
    { 
        // unodered map 'um' implemented as 
        // hash table 
        HashMap<Integer, Integer> um= new HashMap<Integer, Integer>(); 
          
        // 'mod_arr[i]' stores (sum[0..i] % k) 
        int mod_arr[]= new int[n]; 
        int max = 0; 
        int curr_sum = 0; 
          
        // traverse arr[] and build up the 
        // array 'mod_arr[]' 
        for (int i = 0; i < n; i++) 
        { 
            curr_sum += arr[i]; 
            mod_arr[i] = (curr_sum % k);      
        }  
          
        for (int i = n-1; i >= 0; i--) 
        { 
            
            if (mod_arr[i] != 0) 
                max = i + 1; 
       
            else if (um.containsKey(mod_arr[i]) == false) 
                um.put(mod_arr[i] , i); 
                  
            else
                if (max > (i + um.get(mod_arr[i]))) 
                    max = i + um.get(mod_arr[i]);          
        } 
        return max; 
    }     
    
    public static int findAns(long a[],long sum,int start,int end){
        //System.out.println(start+" "+end+" "+x+" "+sum);
        if(start>end){
            return -1;
        }
        if(sum%x!=0){
            mem.put(start+"-"+end,end - start +1);
            return end - start +1;
        }
        if(mem.containsKey(start+"-"+end)){
            return mem.get(start+"-"+end);
        }
        mem.put(start+"-"+end,Math.max(findAns(a,sum-a[start],start+1,end),findAns(a,sum-a[end],start,end-1)));
        return mem.get(start+"-"+end);
    }
    
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                } 
            } 
            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) 
            { 
                
            } 
            return str; 
        } 
    } 
}