#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int INF=1e6+5;
int n,m,a[INF],b[INF],vis[INF];
void solve() {
    cin>>n>>m;a[1]=b[1]=1;
    for (int i=2;i<=n;i++) a[i]=a[i-1]+m;
    for (int i=2;i<=m;i++) b[i]=b[i-1]+n;
    int N=n*m,F=0;
    for (int w=0;w<=N;w++) vis[w]=0;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++) {
            if (vis[a[i]*b[j]%N]) {F=1;break;}
            vis[a[i]*b[j]%N]=1;
        }
    if (F) cout<<"No\n";
    else {
        cout<<"Yes\n";
        for (int i=1;i<=n;i++) cout<<a[i]<<" ";
        cout<<"\n";
        for (int i=1;i<=m;i++) cout<<b[i]<<" ";
        cout<<"\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    int t=0;cin>>t;
    while (t--) solve();
    return 0;
}