You are given an array a consisting of n integers (it is guaranteed that n is even, i.e. divisible by 2). All a_i does not exceed some integer k.

Your task is to replace the minimum number of elements (replacement is the following operation: choose some index i from 1 to n and replace a_i with some integer in range [1; k]) to satisfy the following conditions:

  * after all replacements, all a_i are positive integers not greater than k; 
  * for all i from 1 to n/2 the following equation is true: a_i + a_{n - i + 1} = x, where x should be the same for all n/2 pairs of elements. 



You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains two integers n and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k ≤ 2 ⋅ 10^5) — the length of a and the maximum possible value of some a_i correspondingly. It is guratanteed that n is even (i.e. divisible by 2). The second line of the test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ k), where a_i is the i-th element of a.

It is guaranteed that the sum of n (as well as the sum of k) over all test cases does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5, ∑ k ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer — the minimum number of elements you have to replace in a to satisfy the conditions from the problem statement.

Example

Input


4
4 2
1 2 1 2
4 3
1 2 2 1
8 7
6 1 1 7 6 3 4 6
6 6
5 2 6 1 3 4


Output


0
1
4
2
from sys import stdin, stdout

# 56
# 1 2 3 3 4 6 iv = 0
# 1 2 3.5 3 6 4 iv = 2
# 1 2 3 6 3.5 4
# 1 2 3 3.5 4

# 3 3 4 4
# 3: 1 2 [6 3 3] 4
# 3: 1 2 [3 6 3] 4
# 4: 1 2 3 [4 6 3]
# 4: 1 2 3 [3 4 6]
# 1 2 3 4 5 6
# 1 2 3 3 4 6 iv = 0
#    [3, 3, 4] => [4, 3, 3] = +2, 0, 0
#    [3, 3, 4] => [3, 4, 3] =  0,+1, 0
if __name__ == '__main__':
    def cyclic_shifts_sorting(n, a):
        dic = {}
        dupi = -1
        dupj = -1
        for i in range(n):
            a[i] *= 1000
            if a[i] in dic:
                k = a[i]
                a[i] += dic[k][0]
                dic[k][0] += 1

                if dupi == -1:
                    dupi = dic[k][1]
                    dupj = i
            else:
                dic[a[i]] = [1, i]

        iv = 0
        for i in range(n):
            for j in range(i+1, n):
                if a[i] > a[j]:
                    iv += 1

        if iv % 2 == 1:
            if dupi == -1:
                return [-1]
            else:
                tmp = a[dupi]
                a[dupi] = a[dupj]
                a[dupj] = tmp

        sa = sorted(a)

        #print(a)
        #print(sa)

        res = []
        for i in range(n):
            if sa[i] == a[i]:
                continue

            idx = -1
            for j in range(n):
                if a[j] == sa[i]:
                    idx = j
                    break

            # 3 4 5 6 [7 8 1] 10
            # [3 1 4] 5 6
            # [1 4 3] 5 6
            while idx >= i + 2:
                tmp = a[idx]
                a[idx] = a[idx-1]
                a[idx-1] = a[idx-2]
                a[idx-2] = tmp
                res.append(idx-2+1)
                idx -= 2

            if idx > i:
                tmp = a[idx]
                a[idx] = a[idx+1]
                a[idx+1] = a[idx-1]
                a[idx-1] = tmp

                res.append(idx-1+1)
                res.append(idx-1+1)
                idx -= 1

        return [len(res), res]

    t = int(stdin.readline())
    for i in range(t):
        n = int(stdin.readline())
        a = list(map(int, stdin.readline().split()))
        res = cyclic_shifts_sorting(n, a)
        stdout.write(str(res[0]) + '\n')
        if res[0] > -1:
            stdout.write(" ".join(map(str, res[1])) + '\n')

