#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool IsPrime(ll num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) {
      return false;
    }
  }
  return true;
}
ll t, n;
std::vector<bool> ok(410, true);
std::vector<int> ans(410, 0);
signed main() {
  cin >> t;
  for (ll i = 0; i < (t); ++i) {
    cin >> n;
    ll cnt = 0;
    while (cnt < n) {
      ans[cnt] = 4 * n - 2 * cnt;
      cnt++;
    }
    for (ll k = 0; k < (n); ++k) cout << ans[k] << ' ';
    cout << endl;
  }
}
