题意：https://atcoder.jp/contests/arc163/tasks/arc163_c

思路：本题构造主要就是围绕

                               

初始放入2，3，6，然后一直将一个拆解直到满足大小。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<set>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		set<int> st;
		st.insert(2);
		st.insert(3);
		st.insert(6);
		if (n == 1) {
			cout << "Yes" << endl;
			cout << '1' << endl;
			continue;
		}
		if (n == 2) {
			cout << "No" << endl;
			continue;
		}
		while (st.size() < n) {
			for (int i : st) {
//				cout << i << endl;
				int a = i + 1;
				int b = i * (i + 1);
				if (!st.count(a) && !st.count(b)) {
					st.insert(a);
					st.insert(b);
					st.erase(i);
					break;
				}
			}
		}
		cout << "Yes" << endl;
		for (int i : st) {
			cout << i << " ";
		}
		cout << endl;
	}
	return 0;
}