/* Problem URL: https://codeforces.com/problemset/problem/2089/A */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;

const int MAXN = 2e5 + 1;
bool prime[MAXN];

void pre()
{
    fill(prime, prime + MAXN, true);
    prime[1] = false;
    prime[0] = false;
    nrep(i, 2, MAXN) {
        if (!prime[i]) {
            continue;
        }

        for (int j = i << 1; j < MAXN; j += i) {
            prime[j] = false;
        }
    }
}

#define TEST 1

void solve()
{
    int n;
    cin >> n;

    // int n = 7;
    // int cur = 3;
    // nrep(i, 3, n + 1) {
    //     cur += i;
    //     cout << (cur + i - 1) / i << '\n';
    // }

    int l = n / 3;

    int choice = l;
    while (!prime[choice]) {
        choice++;
    }

    int rm = 0;
    int now = 1;
    vi ans(n);

    set<int> act;
    rep(i, n) {
        act.insert(i + 1);
    }

    rep(i, l) {
        ans[i] = choice + rm * now;
        act.erase(ans[i]);

        if (now == 1) {
            now = -1;
            rm++;
        } else {
            now = 1;
        }
    }

    nrep(i, l, n) {
        ans[i] = *act.begin();
        act.erase(act.begin());
    }

    cout << ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}