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.
# DON'T SEE RANK LIST UNTIL CONTEST IS OVER
# TRY AT FIRST ELEMINATION METHOD
# BEGIN FROM FRONT TRACK
# IF ABOVE FAILS TRY FROM BACK TRACK
# DON'T CROSS 10e8
# BELIEVE IN YOURSELF
# IT'S IS NOT PROGRAMMING IT'S MATHEMATICS
# ITS ALL ABOUT COMPERATIVE CODING
# FIND ME AT subrata1999.github.io
# COPYRIGHT Template handler :: subrata1999 @2019

from collections import defaultdict, Counter
from itertools import permutations
from os import system
from sys import stdin, stdout
import queue
import math
from time import time

for _ in range(int(input())):
    n = input()
    arr = set(map(int, input().split()))
    print(len(arr))
