#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e6+5;
int n,m,k,a[M],b[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void solve(){ n=read();m=read();
	if (__gcd(n,m)>1) return puts("No"),void();
	puts("Yes");k=n*m;
	for (int i=1;i<=n;i++) printf("%d ",i%k);puts("");
	for (int i=0;i<m;i++) printf("%d ",(i*n+1)%k);puts("");
	// for (int i=0;i<n;i++) a[i]=i+1;
	// for (int i=0;i<m;i++) b[i]=i*n+1;
	// for (int i=0;i<n;puts(""),i++)
	// 	for (int j=0;j<m;j++)
	// 		printf("%lld ",1ll*a[i]*b[j]%(n*m));
}
int main(){int T=read();while (T--) solve();return 0;}