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
#include <bits/stdc++.h>
using namespace std;
void Do(vector<int>& a, int i) {
  swap(a[i + 1], a[i + 2]);
  swap(a[i], a[i + 1]);
}
bool Ok(vector<int> a) {
  vector<int> b = a;
  sort(b.begin(), b.end());
  for (int i = 0; i < (int)a.size(); i++) {
    if (a[i] != b[i]) {
      return false;
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    vector<pair<int, int>> all(n);
    for (int i = 0; i < n; i++) {
      all[i] = {a[i], i};
    }
    sort(all.begin(), all.end());
    for (int i = 0; i < n; i++) {
      a[all[i].second] = i;
    }
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (a[i] > a[j]) {
          cnt++;
        }
      }
    }
    if (cnt % 2 == 1) {
      for (int i = 0; i < n - 1; i++) {
        if (all[i].first == all[i + 1].first) {
          swap(a[all[i].second], a[all[i + 1].second]);
          break;
        }
      }
    }
    vector<int> ans;
    for (int i = 0; i < n - 2; i++) {
      int j = min_element(a.begin() + i, a.end()) - a.begin();
      while (j > i + 1) {
        Do(a, j - 2);
        ans.push_back(j - 2);
        j -= 2;
      }
      if (j != i) {
        for (int t = 0; t < 2; t++) {
          Do(a, i);
          ans.push_back(i);
        }
        j = i;
      }
    }
    for (int i = 0; i < 3; i++) {
      if (Ok(a)) break;
      Do(a, n - 3);
      ans.push_back(n - 3);
    }
    if (!Ok(a)) {
      cout << -1 << '\n';
    } else {
      cout << (int)ans.size() << '\n';
      for (int i = 0; i < (int)ans.size(); i++) {
        cout << ans[i] + 1 << " ";
      }
      cout << '\n';
    }
  }
  return 0;
}
