#include<cstdio>
#include<algorithm>
#define ll long long
#define maxn 1000005
using namespace std;

const int N=1000000;
int n,m;
int tot,prime[maxn],mark[maxn];
int a[maxn],b[maxn],vis[maxn];

int gcd(int x,int y)
{
    return (y==0)?x:gcd(y,x%y);
}

void solve()
{
    int fl=0;
    scanf("%d%d",&n,&m);
    if(n>m)
    {
        swap(n,m);
        fl=1;
    }
    if(gcd(n,m)!=1)
    {
        printf("No\n");
        return;
    }
    printf("Yes\n");
    ll val=n*m;
    for(int i=1;i<=m;++i)
    b[i]=(n*(i-1)+1)%val;
    for(int i=1;i<=n;++i)
    {
        a[i]=i;
        for(int j=1;j<=m;++j)
        {
            ll x=1LL*a[i]*b[j]%val;
            if(vis[x])
            {
                a[i]+=n;
                break;
            }
            else vis[x]=1;
        }
        for(int j=1;j<=m;++j)
        {
            ll x=1LL*a[i]*b[j]%val;
            vis[x]=0;
        }
    }
    if(fl)
    swap(n,m);
    for(int i=1;i<=n;++i)
    printf("%d ",(!fl)?a[i]:b[i]);
    printf("\n");
    for(int i=1;i<=m;++i)
    printf("%d ",(!fl)?b[i]:a[i]);
    printf("\n");
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    solve();
    return 0;
}