#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
long long power(long long a, long long p) {
  if (p == 0) return 1;
  long long ans = power(a, p / 2);
  ans = (ans * ans) % M;
  if (p % 2) ans = (ans * a) % M;
  return ans;
}
int nC2(int n) { return (n * (n - 1)) / 2; }
int fact(int n) {
  if (n == 0 || n == 1) {
    return 1;
  } else {
    return n * fact(n - 1);
  }
}
int countOne(int n) { return __builtin_popcount(n); }
int checkParity(int n) { return __builtin_parity(n); }
int digitCount(int n) { return floor(log10(n)) + 1; }
int log2(int x) {
  int res = 0;
  while (x >>= 1) res++;
  return res;
}
int isPowerof2(int x) { return (x && !(x & x - 1)); }
bool is_prime(int n) {
  if (n == 1) {
    return false;
  }
  int i = 2;
  while (i * i <= n) {
    if (n % i == 0) {
      return false;
    }
    i += 1;
  }
  return true;
}
int main() {
  int test, n, m, x, y, counter = 0, sum = 0, ans = 0, res = 0, rem = 0;
  bool flag = true;
  bool check = true;
  string s;
  cin >> test;
  while (test--) {
    int n, x;
    cin >> n;
    x = (2 * n);
    for (int i = 0; i < n; i++) {
      cout << x << " ";
      x += 2;
    }
    cout << endl;
  }
  return 0;
}
