#include <cstdio>
#include <algorithm>

const int N = 1000000;
int t, n, m, a[N], b[N];
bool u[N];

void out0() {
	for (int i = 0; i < n; ++i) printf("%d ", a[i]);
	printf("\n");
}

void out1() {
	for (int i = 0; i < m; ++i) printf("%d ", b[i]);
	printf("\n");
}

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &n, &m);
		bool ok = true;
		if (std::__gcd(n, m) == 1) {
			bool sw = false;
			if (n > m) {
				sw = true;
				std::swap(n, m);
			}
			for (int i = 0; i < n; ++i) a[i] = (n + i * m) % (n * m);
			for (int i = 0; i < m; ++i) b[i] = (i * n + m) % (n * m);
			for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) u[i * m + j] = false;
			for (int i = 0; i < n; ++i) {
				for (int j = 0; j < m; ++j) {
					int val = (long long)a[i] * b[j] % (n * m);
					if (u[val]) ok = false;
					u[val] = true;
					//printf("%d ", (a[i] * b[j]) % (n * m));
				}
				//printf("\n");
			}
			if (ok) {
				printf("Yes\n");
				if (sw) {
					out1();
					out0();
				} else {
					out0();
					out1();
				}
			}
		} else ok = false;
		if (!ok) printf("No\n");
	}
	return 0;
}