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 PYTHON3):

Solution:
def solve():
    n,x=input().split()
    x=int(x)
    n = int(n)
    l = list(map(int,input().split()))
    pref = [0]*n
    pref[0] = l[0]
    suff = [0]*n
    suff[n-1] = l[n-1]
    for i in range(1,n):
        pref[i]=pref[i-1]+l[i]
    for i in range(n-2,-1,-1):
        suff[i]=suff[i+1]+l[i]
    max1 = 0
    max2 = 0
    for i in range(n-1,-1,-1):
        if pref[i]%x!=0:
            max1=i+1;
            break
    for i in range(n):
        if suff[i]%x!=0:
            max2=n-i
            break
    if max1==0 and max2==0:
        print(-1)
    else:
        print(max(max1,max2))


t = int(input())
while(t>0):
    solve()
    t-=1