Problem: Today the kindergarten has a new group of n kids who need to be seated at the dinner table. The chairs at the table are numbered from 1 to 4n. Two kids can't sit on the same chair. It is known that two kids who sit on chairs with numbers a and b (a ≠ b) will indulge if: 

  1. gcd(a, b) = 1 or, 
  2. a divides b or b divides a. 



gcd(a, b) — the maximum number x such that a is divisible by x and b is divisible by x.

For example, if n=3 and the kids sit on chairs with numbers 2, 3, 4, then they will indulge since 4 is divided by 2 and gcd(2, 3) = 1. If kids sit on chairs with numbers 4, 6, 10, then they will not indulge.

The teacher really doesn't want the mess at the table, so she wants to seat the kids so there are no 2 of the kid that can indulge. More formally, she wants no pair of chairs a and b that the kids occupy to fulfill the condition above.

Since the teacher is very busy with the entertainment of the kids, she asked you to solve this problem.

Input

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

Each test case consists of one line containing an integer n (1 ≤ n ≤ 100) — the number of kids.

Output

Output t lines, which contain n distinct integers from 1 to 4n — the numbers of chairs that the kids should occupy in the corresponding test case. If there are multiple answers, print any of them. You can print n numbers in any order.

Example

Input


3
2
3
4


Output


6 4
4 6 10
14 10 12 8

Solution (in JAVA):

Solution:
import java.util.*;
import java.lang.Math;
import java.util.concurrent.TimeUnit;
import java.util.stream.Collectors;
import java.io.*;
import java.math.BigInteger;
import java.io.FileWriter;

public class CodeForces1 {

	static class FastReader

	{
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	static FastReader f = new FastReader();

	static void print(String s) {
		System.out.print(s);
	}

	static void print(boolean s) {
		System.out.print(s);
	}

	static boolean isPrime(long n) {
		// Corner cases
		if (n <= 1)
			return false;
		if (n <= 3)
			return true;

		// This is checked so that we can skip
		// middle five numbers in below loop
		if (n % 2 == 0 || n % 3 == 0)
			return false;

		for (int i = 5; i * i <= n; i = i + 6)
			if (n % i == 0 || n % (i + 2) == 0)
				return false;

		return true;
	}

	static long[] inArr(long a[], int n) {
		for (int i = 0; i < n; i++)
			a[i] = f.nextLong();
		return (a);
	}

	static void printSubsets(int set[]) {
		int n = set.length;
		Arrays.sort(set);
		for (int i = 0; i < n; i++) {

		}
		HashMap<Integer, Integer> hm = new HashMap<>();
		for (int i = 0; i < (1 << n); i++) {
			for (int j = 0; j < n; j++) {
				if ((i & (1 << j)) > 0) {
					if (hm.get(set[j]) == null) {
						hm.put(set[j], 0);
					}
					hm.put(set[j], hm.get(set[j]) + 1);

				}
			}

		}
	}

	static long gcd(long a, long b) {
		if (a == 0)
			return b;
		return gcd(b % a, a);
	}

	static long lcm(long a, long b) {
		return (a * b) / gcd(a, b);
	}

	static long power(long x, long y, long p) {

		// Initialize result
		long res = 1;

		// Update x if it is more than or
		// equal to p
		x = x % p;

		while (y > 0) {

			// If y is odd, multiply x
			// with result
			if (y % 2 == 1)
				res = (res * x) % p;

			// y must be even now
			y = y >> 1; // y = y/2
			x = (x * x) % p;
		}

		return res;
	}

	static long modInverse(long n, long p) {
		return power(n, p - 2, p);
	}

	static long nCrModPFermat(int n, int r) {
		long p = 1000000007;

		// Base case
		if (r == 0)
			return 1;

		// Fill factorial array so that we
		// can find all factorial of r, n
		// and n-r
		long[] fac = new long[n + 1];
		fac[0] = 1;

		for (int i = 1; i <= n; i++)
			fac[i] = fac[i - 1] * i % p;

		return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
	}

	public static void main(String args[]) throws Exception {
		BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));
		Random rand = new Random();
		int t = f.nextInt();
		while (t-- != 0) {
			int n=f.nextInt();
			int a=1,p=4*n,p1=4*n;
			ArrayList<Integer> arr=new ArrayList<>();
			arr.add(p);
			
			while(a<n)
			{
				p1--;
				boolean flag=true;
				for(int i=0;i<arr.size();i++)
				{
					if(gcd(p1,arr.get(i))==1 || arr.get(i)%p1==0)
					{
						flag=false;
					}
				}
				if(flag==true)
				{
					a++;
					arr.add(p1);
				}
				
				
				
				
			}
			for(int i=0;i<arr.size();i++)
			{
				w.write(arr.get(i)+" ");
			}
			
			w.write("\n");
		}
		w.flush();

	}
}