#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void sol(){
    int n,m;
    cin>>n>>m;
    if(n==m){
        cout<<"No"<<endl;
        return;
    }
    vector<int>a(n+1),b(m+1);
    set<int>se;
    a[1]=b[1]=1;
    for(int i=2;i<=n;++i)a[i]=a[i-1]+n-1,a[i]%=n*m;
    for(int i=2;i<=m;++i)b[i]=b[i-1]+m-1,b[i]%=n*m;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j){
            int x=a[i]*b[j]%(n*m);
            if(se.count(x)){
                cout<<"No"<<endl;
                return;
            }
            se.insert(x);
        }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;++i)cout<<a[i]<<' ';
    cout<<endl;
    for(int i=1;i<=m;++i)cout<<b[i]<<' ';
    cout<<endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)sol();
    return 0;
}