B"There are n cows participating in a coding tournament. Cow i has a Cowdeforces rating of a_i (all distinct), and is initially in position i . The tournament consists of n-1 matches as follows: You are the owner of cow k . For you, winning the tournament is not important; rather, you want your cow to win in as many matches as possible. As an acquaintance of the tournament organizers, you can ask them to swap the position of your cow with another cow only once, or you can choose to do nothing. Find the maximum number of wins your cow can achieve. Each test contains multiple test cases. The first line contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains two integers n and k ( 2 <= n <= 10^5, 1 <= k <= n ) -- the number of cows and your cow's index. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ) -- the Cowdeforces rating of the cows. It is guaranteed that a_i 's are pairwise different. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case, print one integer: the maximum number of wins cow k can achieve if you choose to swap (or do nothing) optimally. In the first test case, it is optimal to do nothing. Let a' be the Cowdeforces rating of the cows in the original order (with your cow's rating bolded), then In the second test case, it is optimal to swap your cow to position 3 . Then, let a' be the Cowdeforces rating of the cows in the order after the swap. "...