#include <bits/stdc++.h>
#define int int64_t
#define double long double
#define F first
#define S second
#define pb push_back
#define pf push_front
#define ppb pop_back();
#define ppf pop_front();
#define For(n) for (int i = 0; i < n; i++)
#define FOR(i, n) for (i; i < n; i++)
#define optimization ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;
typedef pair <int, int> pii;
typedef deque <int> di;

int binpow(int x, int y)
{
    if (y == 0)
        return 1;
    if (y & 1)
        return binpow(x, y - 1) * x;
    else
    {
        int ans = binpow(x, y / 2);
        return ans * ans;
    }
}

int32_t main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        if ((n / 2) % 2)
            cout << "NO\n";
        else
        {
            cout << "YES\n";
            int a [n], sum1 = 0, sum2 = 0;
            for (int i = 0; i < n / 2; i++)
            {
                a [i] = 2 * i + 2;
                sum1 += a [i];
            }
            for (int i = n / 2; i < n - 1; i++)
            {
                a [i] = 2 * (i - (n / 2)) + 1;
                sum2 += a [i];
            }
            a [n - 1] = sum1 - sum2;
            for (int i = 0; i < n; i++)
                cout << a [i] << " ";
            cout << "\n";
        }
    }
}