#pragma GCC optimize(3)
#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define testin freopen("testin1.txt", "r", stdin)
#define testout freopen("testout1.txt", "w", stdout)
#define NO cout<<"No"<<endl
#define YES cout<<"Yes"<<endl
#define MAYBE cout<<"MAYBE"<<endl
#define endl '\n'
#define ALL(x) x.begin(),x.end()
#define INS(x)inserter(x,x.begin())
using namespace std;
const ll MAXN = 1000010;
const ll INF = 0x3f3f3f3f;
const ll mod = 998244353;
bool DEBUG = true;
vector<ll>numn,numm;
ll uniq[MAXN][2];
void solve() {
	ll n, m;
	cin >> n >> m;
	if (gcd(n, m) != 1) {
		cout << "No" << endl;
		return;
	}
	cout << "Yes" << endl;
	for (int i = 0; i < n; i++) {
		//cout << (1 + (n - 1) * i) % (n * m) << ' ';
	}
	//cout << endl;
	for (int i = 0; i < m; i++) {
		//cout << (1 + (m - 1) * i) % (n * m) << ' ';
	}
	//cout << endl;
	ll flag = 1;
	for (ll d1 = max(n - 1, 1ll); d1 >= 1; d1--) {
		for (ll d2 = max(m - 1, 1ll); d2 >= 1; d2--) {
			flag = 1;
			numn.clear();
			numm.clear();
			for (ll i = 0; i < n; i++) {
				numn.push_back((1 + d1 * i) % (n * m));
			}
			for (ll i = 0; i < m; i++) {
				numm.push_back((1 + d2 * i) % (n * m));
			}
			//map<ll, pair<ll, ll>>uniq;
			for (int i = 0; i < m * n; i++) {
				uniq[i][0] = -1; uniq[i][1] = -1;
			}
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					ll tmp = (numn[i] * numm[j]) % (m * n);
					if (uniq[tmp][0] != -1) {
						if (DEBUG) {
							cout << "ERROR:" << tmp << endl;
							ll fst = uniq[tmp][0];
							ll snd = uniq[tmp][1];
							cout << "FIRST:" << fst + 1 << "," << snd + 1 << endl;
							cout << "SECOND:" << i + 1 << "," << j + 1 << endl;
						}
						flag = 0;
						break;
					}
					else {
						uniq[tmp][0] = i;
						uniq[tmp][1] = j;
					}
				}
				if (flag == 0)break;
			}
			if (flag == 1) {
				for (int i = 0; i < n; i++) {
					cout << (1 + d1 * i) % (n * m) << ' ';
				}
				cout << endl;
				for (int i = 0; i < m; i++) {
					cout << (1 + d2 * i) % (n * m) << ' ';
				}
				cout << endl;
				return;
			}
		}
	}
	return;
}
int main() {
	//testin;
	//freopen("case1out.txt", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}