You are given an array \(A\). The array contains all the elements in the range of \(1\) to \(K\).

Determine the minimum size of the subarray that contains all the \(K\) distinct elements.

Input format

• First line: \(T\) denoting the number of test cases
• For each test case:
  • First line: \(N\) denoting the length of the array and \(K\)
  • Next line: \(N\) integers denoting the elements of the array

Output format
Print the minimum size of the subarray that contains all the \(K\) distinct elements.

Constraints
\(1 \le T \le 10\\ 1 \le N \le 100000\\ 1 \le K \le 10000\)