Indivisible Inversions

While studying for his algorithms midterm, Busy Beaver came up with the following problem and wants your help to solve it.

You are given an integer $N$ and a permutation $p\_1,p\_2,\ldots,p\_N$ of length $N$.1 Find the length of the longest contiguous subarray ($l,r$) ($1 \le l \le r \le N$) of $p$ such that the number of inversions2 of $p\_l,p\_{l+1},\ldots,p\_r$ is not divisible by $K$, or determine if such a subarray does not exist.

Help Busy Beaver find the answer to this problem!

1A permutation of length $N$ is an array consisting of $N$ distinct integers from $1$ to $N$ in arbitrary order. For example, $\[2,3,1,5,4]$ is a permutation, but $\[1,2,2]$ is not a permutation ($2$ appears twice in the array), and $\[1,3,4]$ is also not a permutation ($N=3$ but there is $4$ in the array).

2An inversion in a permutation p is a pair of indices $(i, j)$ such that $i > j$ and $p\_i < p\_j$. For example, a permutation $\[4, 1, 3, 2]$ contains 4 inversions: $(2, 1)$, $(3, 1)$, $(4, 1)$, $(4, 3)$.

Each test contains multiple test cases. The first line of input contains a single positive integer $T$, the number of test cases $(1 \leq T \leq 10^4)$. The description of each test case follows.

The first line of each test case contains two integers $N$ and $K$ ($2 \le K \le N \le 2 \cdot 10^5$).

The second line of each test case contains $N$ distinct positive integers $p\_1,p\_2,\ldots,p\_N$ ($1 \le p\_i \le N$).

It is guaranteed that the sum of $N$ across all test cases does not exceed $2 \cdot 10^5$.

For each test case, output one line with a single integer, indicating the length of the longest contiguous subarray of $p$ such that the number of inversions of the subarray is not divisible by $K$. If such a subarray does not exist, output $-1$.

In the first test case, the number of inversions of $\[1,3,2,4]$ is $1$ (the second and third elements form the only inversion pair). Since $1$ is not divisible by $3$, the longest contiguous subarray whose number of inversions isn't divisible by $5$ is the entire array itself. Thus, the answer to the test case is the length of the entire array, which is $4$.

In the second test case, the number of inversions of each contiguous subarray is $0$ because the array is sorted. Since no contiguous subarray has an inversion count not divisible by $5$, the answer is $-1$.

In the third test case, it can be shown that the longest contiguous subarray whose number of inversions is not divisible by $2$ is $\[3, 1, 4, 2, 6]$, which has $3$ inversions.

In the fourth test case, it can be shown that the longest contiguous subarray whose number of inversions is not divisible by $2$ is $\[5, 1, 4, 6, 2]$, which has $5$ inversions.