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 javax.swing.*;
        import java.io.*;
        import java.util.Arrays;
        import java.util.Scanner;
        import java.util.StringTokenizer;

public class A {

    int INF = (int)1e9+5; // "Бесконечность"

    public static void main(String[] args) throws IOException {
        new A().run();
    }

    private void run() throws IOException {
        Reader in = new Reader();
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

        solve(in, pw);
        pw.close();
    }

    private double count(int n, int h ,int c){
        return ( (double)( h*(n+1) + (c*n) )/ (double)(2*n+1));
    }

    static class Pair{
        long x,y;
        Pair(long x, long y){
            this.x = x;
            this.y = y;
        }
    }

    static class Reader {
        BufferedReader br;
        StringTokenizer st;

        Reader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        Reader(String fileName) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(fileName));
        }

        String next() throws IOException {
            while(st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }

    private void solve(Reader in, PrintWriter out) throws IOException {
        int t = in.nextInt();
        while(t -- > 0){
            int n = in.nextInt();
            int x = in.nextInt();

            int[] a = new int[n];
            int sum  = 0;
            for(int i = 0; i < n; i++) {
                a[i] = in.nextInt();
                sum += a[i];
            }


            if(sum % x == 0){

                int l = 0;
                while (l < n && sum%x == a[l] %x){
                    l++;
                }
                int r = n-1;
                while (r >= 0 && sum%x == a[r] % x) r--;

                int ans = Math.max(n-l-1, r);

                if(ans == 0)out.println(-1);
                else out.println(ans);

            }else {
                out.println(n);
            }
        }
    }
}