Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    int a[505];
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    vector<int> ans;
    for (int i = 0; i < n - 2; i++) {
      int Min = 1e9, ansi;
      for (int j = i; j < n; j++) {
        if (a[j] < Min) {
          Min = a[j];
          ansi = j;
        }
      }
      while (ansi >= i + 2) {
        ans.push_back(ansi - 2);
        swap(a[ansi], a[ansi - 1]);
        swap(a[ansi - 1], a[ansi - 2]);
        ansi -= 2;
      }
      if (ansi != i) {
        ans.push_back(i);
        ans.push_back(i);
        swap(a[ansi], a[ansi - 1]);
        swap(a[ansi], a[ansi + 1]);
      }
    }
    if (a[n - 2] > a[n - 1]) {
      if (a[n - 1] == a[n - 3]) {
        ans.push_back(n - 3);
        printf("%d\n", ans.size());
        for (auto it : ans) {
          printf("%d ", it + 1);
        }
        printf("\n");
      } else {
        int ok = 0;
        for (int j = 0; j < n; j++) {
          if (a[j] == a[j + 1]) {
            for (int k = n - 3; k >= j; k--) {
              ans.push_back(k);
            }
            printf("%d\n", ans.size());
            for (auto it : ans) {
              printf("%d ", it + 1);
            }
            printf("\n");
            ok = 1;
            break;
          }
        }
        if (!ok) printf("-1\n");
      }
    } else {
      printf("%d\n", ans.size());
      for (auto it : ans) {
        printf("%d ", it + 1);
      }
      printf("\n");
    }
  }
  return 0;
}