#include<bits/stdc++.h>
using namespace std;

//#define ONLINE
#ifndef ONLINE
char DEBUG_BUFFER[1000];
#define debug(...) {sprintf(DEBUG_BUFFER,##__VA_ARGS__);\
cerr<<"\033[1;36m"<<DEBUG_BUFFER<<"\033[0;2m"<<"\033[0m";}
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()

#define FAST_IO {ios::sync_with_stdio(false);cin.tie(nullptr);}
inline int read(){static int x; cin>>x; return x;}
inline LL readLL(){static LL x; cin>>x; return x;}
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n=read(),m=read();
	vector<int>a(n),b(m);
	for(int i=0;i<n;i++){
		a[i]=i+1;
	}
	b[0]=1;
	for(int i=1;i<m;i++){
		b[i]=b[i-1]+n;
	}
	vector<int>c(n*m);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			c[1ll*a[i]*b[j]%(n*m)]=1;
		}
	}
	if(accumulate(all(c),0)==n*m){
		cout<<"Yes\n";
		for(int i=0;i<n;i++){
			cout<<a[i]<<" \n"[i==n-1];
		}
		for(int i=0;i<m;i++){
			cout<<b[i]<<" \n"[i==m-1];
		}
		return;
	}
	for(int i=0;i<m;i++){
		b[i]=i+1;
	}
	a[0]=1;
	for(int i=1;i<n;i++){
		a[i]=a[i-1]+m;
	}
	c.assign(n*m,0);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			c[1ll*a[i]*b[j]%(n*m)]=1;
		}
	}
	if(accumulate(all(c),0)==n*m){
		cout<<"Yes\n";
		for(int i=0;i<n;i++){
			cout<<a[i]<<" \n"[i==n-1];
		}
		for(int i=0;i<m;i++){
			cout<<b[i]<<" \n"[i==m-1];
		}
		return;
	}
	cout<<"No\n";
}
int main(){
	FAST_IO;
	for(int T=read();T--;) solve();
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/