#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<ctime>
#include<random>
using namespace std;
const int MX=1000010;

int T, N, M;
int ar[MX], br[MX];
bool vis[MX];
vector<int> va, vb;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int gcd(int a, int b){return b==0?a:gcd(b,a%b);}
int main()
{
    // freopen("testdata.in","r",stdin);
    // freopen("testdata.out","w",stdout);
    T=read();
    while(T--)
    {
        va.clear(); vb.clear();
        N=read(); M=read();
        int p=N*M;
        bool ck=0;
        if(gcd(N,M)!=1) {cout << "No\n"; continue;}
        for(int i=N;i>=1;i--)
            if(gcd(i,N)==1) va.push_back(i);
        shuffle(va.begin()+1,va.end(),default_random_engine(time(0)));
        for(int i=M;i>=1;i--)
            if(gcd(i,M)==1) vb.push_back(i);
        shuffle(vb.begin()+1,vb.end(),default_random_engine(time(0)));
        for(auto a:va)
        {
            for(auto b:vb)
            {
                if(gcd(a,b)!=1) continue;    
                // cout << "a=" << a << ", b=" << b << '\n';
                for(int i=1;i<=N;i++) ar[i]=(1+1ll*(i-1)*a)%p;
                for(int i=1;i<=M;i++) br[i]=(1+1ll*(i-1)*b)%p;
                bool tag=0;
                for(int i=1;i<=N;i++)
                {
                    for(int j=1;j<=M;j++)
                    {
                        int now=(1ll*ar[i]*br[j])%p;
                        if(vis[now]) {tag=1; break;}
                        vis[now]=1;
                    }
                    if(tag) break;
                }
                if(!tag) {ck=1; break;}
                for(int i=0;i<=N*M;i++) vis[i]=0;
            }
            if(ck) break;
        }
        if(ck)
        {
            cout << "Yes\n";
            for(int i=1;i<=N;i++) cout << ar[i] << " "; cout << '\n';
            for(int i=1;i<=M;i++) cout << br[i] << " "; cout << '\n';
        }
        // else cout << "No\n";
        for(int i=0;i<=N*M;i++) vis[i]=0;
    }
    return (0-0);
}