B'An identity permutation of length n is an array [1, 2, 3, ... , n] . We performed the following operations to an identity permutation of length n : You are given the values of n and m , and the resulting array. Your task is to find all possible values of k in the cyclic shift operation. The first line contains one integer t ( 1 <= t <= 10^5 ) -- the number of test cases. Each test case consists of two lines. The first line contains two integers n and m ( 3 <= n <= 3 cdot 10^5 ; 0 <= m <= frac{n}{3} ). The second line contains n integers p_1, p_2, ... , p_n ( 1 <= p_i <= n , each integer from 1 to n appears in this sequence exactly once) -- the resulting array. The sum of n over all test cases does not exceed 3 cdot 10^5 . For each test case, print the answer in the following way: Consider the example: '...