#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double e = 2.71828182845904523;
vector<bool> prime(100010, true);
void sieve() {
  for (int p = 2; p * p <= 100005; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 100005; i += p) prime[i] = false;
    }
  }
}
long long int fastPower(long long int a, long long int p) {
  long long int res = 1;
  while (p) {
    if (p % 2 == 0) {
      a = (a * a) % 998244353;
      p /= 2;
    } else {
      res = (res * a) % 998244353;
      p--;
    }
  }
  return res;
}
long long int facto(long long int num) {
  long long int res = 1;
  for (long long int i = 1; i <= num; i++) {
    res = (res * i) % 1000000007;
  }
  return res;
}
long long int divide(long long int x, long long int y) {
  long long int res = (x * fastPower(y, 998244353 - 2)) % 998244353;
  return res;
}
void solve() {
  long long int n, m, a, b, c, d, k, l, r, q, x, t;
  string s;
  cin >> n;
  long long int start = 4 * n;
  for (long long int i = 1; i <= n; i++) {
    cout << start << " ";
    start -= 2;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
    cout << endl;
  }
  return 0;
}
