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:
# May the Speedforce be with us...
'''
problem statement achhe se padhna hai
age se bhi dekhna hai, piche se bhi dekhna hai
'''
#from math import gcd,ceil,sin,radians,cos
#from bisect import insort
#from collections import defaultdict as dd
def lcm(a,b):
	return (a*b)//gcd(a,b)
def inin():
	return int(input())
def inar():
	return list(map(int,input().split()))
def ar(element,size):
	return [element for i in range(size)]
def yes():
	print('Yes')
def no():
	print('No')
'''
def countDivisibles(A, B, M): #count numbers in the range[A,B] which are divisible by M
    if (A % M == 0): 
        return ((B // M) - (A // M)) + 1
    return ((B // M) - (A // M)) 
	
def  countSetBits(n): #count the number of set bits in the binary representation of an integer
    count = 0
    while (n): 
        count += n & 1
        n >>= 1
    return count
def digitsum(num): #return the sum of dogots of a number
	su=0
	while(num):
		su+=num%10
		num//=10
	return su
'''

Testcase=inin()
for _ in range(Testcase):
	n,x=inar()
	a=inar()
	if sum(a)%x:
		print(n)
		continue
	i=0
	j=n-1
	curr1=0
	curr2=0
	while(i<n):
		if (curr1+a[i])%x:
			break 
		curr1+=a[i]
		i+=1
	while(j>0):
		if (curr2+a[j])%x:
			break 
		curr2+=a[j]
		j-=1
	an=(max(n-1-i,j))
	if an:
		print(an)
	else:
		print(-1)