#include <bits/stdc++.h>

using namespace std;

using i32 = int32_t;
using i64 = long long;

#define int i64

using vi = vector<int>;
using pii = pair<int,int>;
const int inf = LLONG_MAX / 2;

int n, m;

void solve() {
	int n, m;
	cin >> n >> m;
	if(n == m and n == 1) {
		cout << "Yes\n";
		cout << "0\n0\n";
		return ;
	}
	// if(n == m) {
	// 	cout << "No\n";
	// 	return;
	// }
	if(gcd(n, m) != 1) {
		cout << "No\n";
		return;
	}
	vi a(n), b(m);
	a[0] = b[0] = 1;
	for(int i = 1; i < n; i ++) a[i] = a[i - 1] + m;
	for(int i = 1; i < m; i ++) b[i] = b[i - 1] + n;

	bool ok = true;
	set<int> cnt;
	for(auto x : a) {
		if(ok == false) break;
		for(auto y : b) {
			if(ok == false) break;
			if(cnt.insert((x * y) % (n * m)).second == false) ok = false;
		}
	}
	assert(ok);
	if(ok == false) {
	
		// cout << "No\n";
		return;
	}
	cout << "Yes\n";
	for(auto i : a) cout << i << " ";
	cout << "\n";
	for(auto i : b) cout << i << " ";
	cout << "\n";
	return ;
}

i32 main(){
	ios::sync_with_stdio(false), cin.tie(nullptr);
	
	int T;
	cin >> T;

	while(T --) solve();
	
	return 0;
}