#include<bits/stdc++.h>
#define int long long
#define pp printf("\n")
using namespace std;
int a[1000001],b[1000001];
int gcd(int x,int y)
{
    int r=x%y;
    while (r)
    {
        x=y,y=r;r=x%y;
    }
    return y;
}
int n,m,T;
map<int,int>Q;
signed main()
{
    scanf("%lld",&T);
    while (T--)
    {
        scanf("%lld %lld",&n,&m);
        //n=rand()%1000+1,m=rand()%1000+1;
        if (gcd(n,m)!=1)
        {
            printf("No\n");
            continue;
        } 
        printf("Yes\n");
        for (int i=1;i<=n;i++)a[i]=(i-1)*m+1;
        for (int i=1;i<=m;i++)b[i]=(i-1)*n+1;
        for (int i=1;i<=n;i++)printf("%lld ",a[i]);pp;
        for (int i=1;i<=m;i++)printf("%lld ",b[i]);pp;
        // Q.clear();
        // for (int i=1;i<=n;i++)
        //     for (int j=1;j<=m;j++)if (Q.count(a[i]*b[j]%(n*m)))
        //     {
        //         printf("%lld %lld zmy\n",n,m);
        //         return 0;
        //     }
        //     else  Q[a[i]*b[j]%(n*m)]=1;
    }
    
}