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.math.*;
import java.io.*;
import java.awt.*;
import java.util.*;
public class Solution{
    static Helper hp;
    final static int MAXN = 1000_006;
    final static long MOD = (long) 1000000007;
    final static long MOD1 = (long) 998244353;
    public static void debug(Object s)throws Exception{
        if(hp.debugger)System.out.println(s.toString());
    }
    public static void debug(int a[])throws Exception{
        if(hp.debugger)System.out.println(Arrays.toString(a));
    }
    public static void main(String []args)throws Exception
    {
        hp=new Helper(MOD,MAXN);
        //hp.initIO("input.txt","output.txt");
        hp.initIO(System.in,System.out);
        solve();
    }
    static void solve()throws Exception{
        boolean testCases = true;
        int tc =testCases?hp.nextInt():1;
        for (int tce = 1; tce <= tc; tce++) {
            int n=hp.nextInt(),x=hp.nextInt();
            int a[]=new int[n];
            long sum=0;int first=-1,last=-1;
            for(int i=0;i<n;i++)
            {
                a[i]=hp.nextInt();
                sum+=a[i];
                if(a[i]%x!=0 && first==-1) 
                    first=i;
                if(a[i]%x!=0)
                    last=i;
            }
            if(sum%x!=0)
            {
                hp.println(n);
                continue;
            }
            if(first==-1)
            {
                hp.println(-1);
            continue;
            }
            int ans=Math.max(n-first-1,last);
            if(ans==0)
                hp.println(-1);
            else
                hp.println(ans);
        }
        hp.flush();
    }
    
}
class Graph
{
    int n;
    int topic[];
    ArrayList<Integer> adj[];
    Graph(int n)
    {
        this.n=n;
        adj=new ArrayList[n];
        for(int i=0;i<n;i++)
            adj[i]=new ArrayList<>();
    }
    void addEdge(int i,int j)
    {
        adj[i].add(j);
        adj[j].add(i);
    }
    boolean solve()
    {
        for(int i=1;i<n;i++)
        {
            int z=topic[i];
            Set<Integer> set=new HashSet<>();
            for(int x:adj[i])
            {
                if(topic[x]==z)
                    return false;
                if(topic[x]<z)
                {
                    set.add(topic[x]);
                }
            }
            if(set.size()+1!=z)
            {
                return false;
            }
        }
        return true;
    }
}
class Helper {
    final long MOD;
    final int MAXN;
    final Random rnd;
    boolean debugger;
    public Helper(long mod, int maxn) {
        MOD = mod;
        MAXN = maxn;
        rnd = new Random();
    }


    public static int[] sieve;
    public static ArrayList<Integer> primes;

    public void setSieve() {
        primes = new ArrayList<>();
        sieve = new int[MAXN];
        int i, j;
        for(i=0;i<MAXN;i++) sieve[i]=i;
        for (i = 2; i*i< MAXN; ++i)
        {
            if (sieve[i] == i) {
                for (j = i*i;j < MAXN; j += i) {
                    if(sieve[j]==j)
                    sieve[j] = i;
                }
            }
        }
        for(i=2;i<MAXN;i++)if(sieve[i]==i)primes.add(i);
    }

    public static long[] factorial;

    public void setFactorial() {
        factorial = new long[MAXN];
        factorial[0] = 1;
        for (int i = 1; i < MAXN; ++i) factorial[i] = factorial[i - 1] * i % MOD;
    }

    public long getFactorial(int n) {
        if (factorial == null) setFactorial();
        if(n<0)
            return 1;
        return factorial[n];
    }

    public long ncr(int n, int r) {
        if (r > n) return 0;
        if (factorial == null) setFactorial();
        long numerator = factorial[n];
        long denominator = factorial[r] * factorial[n - r] % MOD;
        return numerator * pow(denominator, MOD - 2, MOD) % MOD;
    }


    public Long[] getLongArray(int size) throws Exception {
        Long[] ar = new Long[size];
        for (int i = 0; i < size; ++i) ar[i] = new Long(nextLong());
        return ar;
    }

    public Integer[] getIntArray(int size) throws Exception {
        Integer[] ar = new Integer[size];
        for (int i = 0; i < size; ++i) ar[i] = new Integer(nextInt());
        return ar;
    }

    public String[] getStringArray(int size) throws Exception {
        String[] ar = new String[size];
        for (int i = 0; i < size; ++i) ar[i] = next();
        return ar;
    }

    public String joinElements(long... ar) {
        StringBuilder sb = new StringBuilder();
        for (long itr : ar) sb.append(itr).append(" ");
        return sb.toString().trim();
    }


    public String joinElements(int... ar) {
        StringBuilder sb = new StringBuilder();
        for (int itr : ar) sb.append(itr).append(" ");
        return sb.toString().trim();
    }

    public String joinElements(String... ar) {
        StringBuilder sb = new StringBuilder();
        for (String itr : ar) sb.append(itr).append(" ");
        return sb.toString().trim();
    }

    public String joinElements(Object... ar) {
        StringBuilder sb = new StringBuilder();
        for (Object itr : ar) sb.append(itr).append(" ");
        return sb.toString().trim();
    }


    public long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    public int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }
    public int max(int ... ar)
    {
        int max=ar[0];
        for(int itr:ar)
            max=Math.max(max,itr);
        return max;
    }
    public long max(long ... ar){
        long max=ar[0];
        for(long itr:ar)max=Math.max(max,itr);
        return max;
    }
    public <T extends Comparable<T>> T max(T ... ar)
    {
        T max=ar[0];
        for(T itr:ar) max=itr.compareTo(max)>0?itr:max;
        return max;
    }
    public <T extends Comparable<T>> T min(T ... ar)
    {
        T min=ar[0];
        for(T itr:ar) min=itr.compareTo(min)<0?itr:min;
        return min; 
    }
    public Long sum(Long... arr)
    {
        Long sum=new Long(0);
        for(Long itr:arr)sum+=itr;
        return sum;
    }
    public Long sum(Integer ... arr)
    {
        Long sum=new Long(0);
        for(Integer itr:arr)sum+=itr;
        return sum;
    }
    public long sum(long... ar) {
        long sum = 0;
        for (long itr : ar) sum += itr;
        return sum;
    }

    public long sum(int... ar) {
        long sum = 0;
        for (int itr : ar) sum += itr;
        return sum;
    }

    public long pow(long base, long exp, long MOD) {
        base %= MOD;
        long ret = 1;
        while (exp > 0) {
            if ((exp & 1) == 1) ret = ret * base % MOD;
            base = base * base % MOD;
            exp >>= 1;
        }
        return ret;
    }


    static final int BUFSIZE = 1 << 20;
    static byte[] buf;
    static int index, total;
    static InputStream in;
    static BufferedWriter bw;


    public void initIO(InputStream is, OutputStream os) {
        try {
            debugger=false;
            in = is;
            bw = new BufferedWriter(new OutputStreamWriter(os));
            buf = new byte[BUFSIZE];
        } catch (Exception e) {
        }
    }

    public void initIO(String inputFile, String outputFile) {
        try {
            debugger=true;
            in = new FileInputStream(inputFile);
            bw = new BufferedWriter(new OutputStreamWriter(
                    new FileOutputStream(outputFile)));
            buf = new byte[BUFSIZE];
        } catch (Exception e) {
        }
    }

    private int scan() throws Exception {
        if (index >= total) {
            index = 0;
            total = in.read(buf);
            if (total <= 0)
                return -1;
        }
        return buf[index++];
    }

    public String next() throws Exception {
        int c;
        for (c = scan(); c <= 32; c = scan()) ;
        StringBuilder sb = new StringBuilder();
        for (; c > 32; c = scan())
            sb.append((char) c);
        return sb.toString();
    }

    public int nextInt() throws Exception {
        int c, val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+')
            c = scan();
        for (; c >= '0' && c <= '9'; c = scan())
            val = (val << 3) + (val << 1) + (c & 15);
        return neg ? -val : val;
    }

    public long nextLong() throws Exception {
        int c;
        long val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+')
            c = scan();
        for (; c >= '0' && c <= '9'; c = scan())
            val = (val << 3) + (val << 1) + (c & 15);
        return neg ? -val : val;
    }

    public void print(Object a) throws Exception {
        bw.write(a.toString());
    }

    public void printsp(Object a) throws Exception {
        print(a);
        print(" ");
    }

    public void println() throws Exception {
        bw.write("\n");
    }

    public void println(Object a) throws Exception {
        print(a);
        println();
    }

    public void flush() throws Exception {
        bw.flush();
    }
}