#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define lson 2*p
#define rson 2*p+1
#define x first
#define y second
#define endl "\n"
const int N=1e6+10;
const int mod=1e9+7;
int n,m;
vector<int> a,b;
int vis[N];
void solve() {
    cin>>n>>m;
    int flag=0;
    if(n==m) {
        if(n==1) {
            cout<<"Yes"<<endl;
            cout<<0<<endl;
            cout<<0<<endl;
        } else {
            cout<<"No"<<endl;
        }
        return ;
    }
    if(n%2==0&&m%2==0) {
        cout<<"No"<<endl;
        return ;
    }
    if(n%2==1&&m%2==1) {
        if(vis[n]||vis[m]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        if(n<m) {
            for(int i=1;i<=n;i++) cout<<i<<" ";
            cout<<endl;
            for(int i=1;i<=m;i++) cout<<(i-1)*n+1<<" ";
            cout<<endl;
        } else {
            for(int i=1;i<=n;i++) cout<<(i-1)*m+1<<" ";
            cout<<endl;
            for(int i=1;i<=m;i++) cout<<i<<" ";
            cout<<endl;
        }
    } else if(n%2==0) {
        if(m<n) {
            cout<<"No"<<endl;
            return ;
        }
        if(vis[m]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<i<<" ";
        cout<<endl;
        for(int i=1;i<=m;i++) cout<<(i-1)*n+1<<" ";
        cout<<endl;
    } else {
        if(n<m) {
            cout<<"No"<<endl;
            return ;
        }
        if(vis[n]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<(i-1)*m+1<<" ";
        cout<<endl;
        for(int i=1;i<=m;i++) cout<<i<<" ";
        cout<<endl;
    }

}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    int T=1;
    for(int i=2;i<N;i++) {
    	if(!vis[i]) {
    		for(int j=i*2;j<N;j+=i) vis[j]=1;
		}
	}
     cin>>T;
    while(T--) {
        solve();
    }
}