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

public class Codeforces {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        solution obj = new solution();
        int test = in.nextInt();
        obj.solve(test, in, out);
        out.close();
    }

    static class solution {
        // static final int MOD = 1000000007;

        public void solve(int testCases, InputReader sc, PrintWriter out) {
            for (int ii = 0; ii < testCases; ii++) {
                int n = sc.nextInt();
                int x = sc.nextInt();
                int a[] = new int[n];
                long sum = 0;
                for (int i = 0; i < n; i++) {
                    a[i] = sc.nextInt();
                    sum += a[i];
                }
                if (sum % x != 0) {
                    out.write(n + "\n");
                } else {
                    if ((x & 1) == 1) {
                        int len = -1;
                        for (int i = 0; i < n; i++) {
                            if ((sum - a[i]) % x != 0) {
                                len = Math.max(len, Math.max(n - i - 1, i));
                            }
                        }
                        out.write(len + "\n");
                    } else {
                        int len = -1;
                        for (int i = 0; i < n; i++) {
                            if ((sum - a[i]) % x != 0) {
                                len = Math.max(len, Math.max(n - i - 1, i));
                            }
                        }
                        out.write(len + "\n");
                    }
                }
            }
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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

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