Giving you three integers: n, m, k and a
sequence {a_{n}}. The
elements in {a_{n}} are
distinct. Please find the longest continuous subsequence whose kth smallest element
is as large as possible. And the subsequence’s length is larger than or equal to m. Please
print the length of the subsequence.

The first line is an integer T, which is
the number of test cases. (1 <= T <= 10)

Each test case begins with three integers,
n, m and k. (1 <= n <= 300000, 1 <= k <= m <= n)

Then n integers represent the elements in {a_{n}}. (1 <= a_{i }<= 10^{7})

An integer for each test case, the length
problem required.