#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, k; cin >> n >> k;
		if (k == 1 || k == n) {
			cout << "No" << endl;
			continue;
		}
		vector v(3, vector<int>(n, -1));
		v[0][0] = 0;
		v[0][n - 1] = 1;
		v[1][0] = 1;
		v[1][n - 1] = 2;
		v[2][0] = 2;
		v[2][n - 1] = 0;
		int x = 3;
		rep(i, 3) {
			rep2(j, n - k, n - 1) {
				v[i][j] = x++;;
			}
		}
		rep(i, 3) {
			rrep2(j, 1, n - k) {
				v[i][j] = x++;;
			}
		}

		cout << "Yes" << endl;
		rep(i, 3) {
			rep(j, n)cout << v[i][j] + 1 << " ";
			cout << endl;
		}
	}
	return 0;
}