# Do You Know LIS? ashikurrahman AUST Programming Lab 2 Se...
Limits 3s, 512 MB

Alam has an array $a$ with $n$ elements $a_1, a_2, …, a_n$ and an integer $x$.

For each $i$ $(1 \le i \le n - 1)$ index $i$ and $i + 1$ are neighbours. But recently index $x$ had a quarrel with his neighbour $x + 1$. So they are not neighbour anymore.

Alam loves Longest Increasing subsequences and wants the Longest Increasing subsequence of the array $a$ to be as long as possible.

You have a special power. You can swap any two values of the array $a$ if they are neighbors.

So, help Alam find his Longest increasing subsequence of the array $a$ using your special power zero or more number of times.

## Input

First line contains a single integer $t$ $(1 \le t \le 10^5)$ $—$ the number of test cases.

Each test case starts with two integers $n$ and $x$ $(2 \le n \le 10^5)$ and $(1 \le x \le n - 1)$ $—$ the number of element of the array $a$ and the integer $x$ describe in the problem statement.

Next line contains $n$ space separated integers $a_1, a_2, …, a_n$ $—$ the elements of the array.

It is guaranteed that the sum of all $n$ in over all test cases will not exceed $10^6$ and all the elements of array $a$ will fit into a 32 bit signed integer.

## Output

For each test case print a single integer $—$ the length of the longest increasing subsequence of the array $a$ after using you special power zero or more amount of times.

## Sample

InputOutput
2
3 1
1 2 3
4 2
2 2 5 4

3
4


### Submit 