#include<bits/stdc++.h>
#define int long long
#define ll long long
#define endl '\n'
using namespace std;
const ll maxn=1e6+5;
ll n,m;
bool vis[maxn];
vector<ll>ans[2];
void solve(){
	cin>>n>>m;
	ll flag=0;
	if(n>m)swap(n,m),flag=1;
	ll mod=n*m;
	ll p=1;
	for(ll i=0;i<=n*m;i++){
		vis[i]=0;
	}
	ans[0].clear();
	ans[1].clear();
	for(ll i=1;i<=n;i++){
		ans[1].push_back(p);
		for(ll j=1;j<=m;j++){
			ll q=1+(j-1)*n;
			ll x=p*q%mod;
			if(vis[x]){
				cout<<"No"<<endl;
				return ;
			}
			vis[x]=1;
		}
		while(vis[p])p++;
	}
	cout<<"Yes"<<endl;
	for(ll i=1;i<=m;i++)ans[0].push_back(1+(i-1)*n);
	for(auto it:ans[0^flag])cout<<it<<" ";
	cout<<endl;
	for(auto it:ans[1^flag])cout<<it<<" ";
	cout<<endl;
	return ;
}
int T=1;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>T;
	for(int kase=1;kase<=T;kase++){
		solve();
	}
	return 0;
}