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 getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setrecursionlimit(1000000)
INF = 10 ** 17
MOD = 1000000007

from fractions import *
def inverse(f):
    # return Fraction(f.denominator,f.numerator)
    return 1/f

def make_next(n, nums):
    imos = [0 for i in range(n)]
    for i, num in enumerate(nums):
        if num > i:
            imos[0] += 1
        else:
            imos[i - num] += 1

        if i + num + 1 < n:
            imos[i+num+1] -= 1
    # print(imos)
    nx = []
    tmp = 0
    for im in imos:
        tmp += im
        nx.append(tmp)

    return nx

def mantan_check(n, nums):
    if sum(nums) == n ** 2:
        return True
    else:
        return False
def knapsack(tree, vx, l):
    dp = [0 for i in range(l + 1)]
    while True:
        dpcp = copy.copy(dp)
        v, w = tree[vx-1]
        # print(v, w)
        for i, d in enumerate(dp):
            if w + i < l + 1:
                if dpcp[w + i] < v + d:
                    dpcp[w + i] = v + d
        dp = copy.copy(dpcp)
        vx //= 2
        dp = dpcp
        # print(dp)
        if vx == 0:
            break

    return max(dp)

def solve():
    n, x = getList()
    nums = getList()
    acc = [0]
    tmp = 0
    for num in nums:
        tmp += num
        tmp %= x
        acc.append(tmp)

    # print(acc)
    if acc[-1] != 0:
        print(n)
        return

    res = []

    for i, ac in enumerate(acc):
        if ac != 0:
            res.append(i)
    # print(res)
    if not res:
        print(-1)
        return

    print(max(res[-1], n - res[0]))
    return
    # print(acc)

    # l, r = 0, n-1
    # while(r - l > 1):
    #     # print(l, r)
    #     if acc[l] != acc[r]:
    #         print(r - l + 1)
    #         return
    #     elif acc[l+1] != acc[r]:
    #         print(r - l)
    #         return
    #     elif acc[l] != acc[r+1]:
    #         print(r-l)
    #         return
    #     else:
    #         l += 1
    #         r -= 1
    #
    # print(-1)
    return





def main():
    n = getN()
    for _ in range(n):
        solve()
if __name__ == "__main__":
    main()

"""
5 10000000000000
4 0 0 0 0
"""