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
import java.io.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
	public static void main(String[] args) throws Exception {
		new template().run();
	}
	public void run() throws Exception {
		FastScanner f = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		///
		int asdf = f.nextInt();
		while(asdf-->0) {
			int n = f.nextInt();
			int[] arr = new int[n];
			HashMap<Integer,Integer> hm = new HashMap<>();
			ArrayList<Integer> moves = new ArrayList<>();
			int[] cnt = new int[500];
			boolean flip = false;
			for(int i = 0; i < n; i++) {
				int a = f.nextInt();
				hm.put(a, hm.getOrDefault(a, 0)+1);
				arr[i] = 1000*a+hm.get(a);
				cnt[a-1] ^= 1;
				for(int j = 499; j >= a; j--) if(cnt[j] % 2 == 1) flip ^= true;
			}
			if(flip) {
				int a = -1;
				for(int i : hm.keySet())
					if(hm.get(i) >= 2) {
						a = i;
						break;
					}
				if(a == -1) {
					out.println(-1);
					continue;
				}
				for(int i = 0; i < n; i++)
					if(arr[i] == a*1000+1) arr[i]++;
					else if(arr[i] == a*1000+2) arr[i]--;
			}
			for(int e = n-1; e >= 2; e--) {
				int max = arr[0], loc = 0;
				for(int i = 1; i <= e; i++)
					if(arr[i] >= max) {
						max = arr[i];
						loc = i;
					}
				if(loc == 0) {
					moves.add(1);
					loc++;
					int t = arr[2];
					arr[2] = arr[1];
					arr[1] = arr[0];
					arr[0] = t;
				}
				for(; loc < e; loc++) {
					moves.add(loc);
					int t = arr[loc+1];
					arr[loc+1] = arr[loc];
					arr[loc] = arr[loc-1];
					arr[loc-1] = t;
				}
			}
			boolean ok = true;
			for(int i = 0; i < n-1; i++) ok &= arr[i] <= arr[i+1];
			if(!ok) {
				
			}
			if(ok) {
				out.println(moves.size());
				for(int i : moves) out.print(i + " ");
				out.println();
			} else out.println(-1);
		}
///
		out.flush();
	}
///
	static class FastScanner {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public FastScanner() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32768);
			tokenizer = null;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public String nextLine() {
			try {
				return reader.readLine();
			} catch(IOException e) {
				throw new RuntimeException(e);
			}
		}
	}
}