//////////////////////////
// Author: lnyxj
// Time: 2024-11-27 16:14:42
///////////////////////////
#include <bits/stdc++.h>
#define xx first
#define yy second
// #define int long long
// #define double long double
using namespace std;
const int N = 2e5 + 5, mod = 998244353, inv2 = mod + 1 >> 1, inf = 0x3f3f3f3f;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;

int n, m;
int a[N];

void solve() {
	cin >> n >> m;
	if (__gcd(n, m) != 1) {
		cout << "No\n";
		return;
	}
	cout << "Yes\n";
	for (int i = 1; i <= n; ++ i) 
		cout << (i - 1) * m + 1 << " \n"[i == n];
	for (int i = 1; i <= m; ++ i) 
		cout << (i - 1) * n + 1 << " \n"[i == m];
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	cin >> T;
	while (T --) solve();
	return 0;
}