#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (T i : v) os << i << ' ';
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& v) {
  for (T i : v) os << i << ' ';
  return os;
}
template <class T, class S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
  os << v.first << ' ' << v.second;
  return os;
}
template <class T, class S>
ostream& operator<<(ostream& os, const unordered_map<T, S>& v) {
  for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' ';
  return os;
}
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
    "avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
clock_t time_p = clock();
void starboy1299() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void solve() {
  long long n;
  cin >> n;
  long long half = n / 2;
  if (half % 2) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
  long long sum = 0;
  for (long long i = 0; i < half; i++) {
    cout << (i + 1) * 2 << " ";
    sum += (i + 1) * 2;
  }
  long long sum2 = 0;
  for (long long i = 0; i < half - 1; i++) {
    cout << (i + 1) * 2 - 1 << " ";
    sum2 += (i + 1) * 2 - 1;
  }
  cout << sum - sum2 << '\n';
}
int32_t main() {
  fast();
  long long t;
  cin >> t;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
}
