B"Let's define a permutation of length n as an array p of length n , which contains every number from 1 to n exactly once. You are given a permutation p_1, p_2, ... , p_n and a number k . You need to sort this permutation in the ascending order. In order to do it, you can repeat the following operation any number of times (possibly, zero): Unfortunately, some permutations can't be sorted with some fixed numbers k . For example, it's impossible to sort [2, 4, 3, 1] with k = 2 . That's why, before starting the sorting, you can make at most one preliminary exchange: Your task is to: For example, if k = 2 and permutation is [2, 4, 3, 1] , then you can make a preliminary exchange of p_1 and p_4 , which will produce permutation [1, 4, 3, 2] , which is possible to sort with given k . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains two integers n and k ( 2 <= n <= 2 cdot 10^5 ; 1 <= k <= n - 1 ) -- length of the permutation, and a distance between elements that can be swapped. The second line of each test case contains n integers p_1, p_2, ... , p_n ( 1 <= p_i <= n ) -- elements of the permutation p . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10 ^ 5 . For each test case print In the first test case, there is no need in preliminary exchange, as it is possible to swap (p_1, p_2) and then (p_2, p_3) . In the second test case, there is no need in preliminary exchange, as it is possible to swap (p_1, p_3) and then (p_2, p_4) . In the third test case, you need to apply preliminary exchange to (p_2, p_3) . After that the permutation becomes [3, 4, 1, 2] and can be sorted with k = 2 . "...