#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (!a) return b;
  return gcd(b % a, a);
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) {
      res = (res * x) % p;
    }
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  if (k == 1) return n % 998244353;
  return (((n * choose(n - 1, k - 1)) % 998244353) *
          mpower(k, 998244353 - 2, 998244353)) %
         998244353;
}
void precal() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(9);
  srand(time(NULL));
}
int main() {
  precal();
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long t1 = n / 2;
    if (t1 % 2 != 0) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
      for (long long i = 0; i < t1; i++) {
        cout << 2 * (i + 1) << " ";
      }
      for (long long i = 0; i < t1 - 1; i++) {
        cout << 2 * i + 1 << " ";
      }
      cout << t1 * (t1 + 1) - (t1 - 1) * (t1 - 1) << endl;
    }
  }
}
