#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pii pair<int, int>
using namespace std;
int vis[1000000]{};
void solve() {
    int n,m;
    cin>>n>>m;
    int flag=0;
    if(n>m)swap(n,m),flag=1;
    if(__gcd(n,m)!=1){
        cout<<"No\n";return;
    }
    // int d2=n;
    vector<int>now;
    for(int d2=1;d2<=n;d2++)
    for(int i=1;i<=m;i++){
        if(__gcd(i,d2)!=1)continue;
        vector<int>b;
        vector<int>a;
        for(int j=1;j<=m;j++)b.push_back(1+d2*(j-1));
        for(int j=1;j<=n;j++)a.push_back(1+i*(j-1));

        int valid=1;
        for(auto p:a)
         for(auto t:b){
            if(valid==0)break;
            if(vis[p*t%(n*m)]){
                valid=0;
                for(auto x:now)vis[x]=0;
                now.clear();
                break;
            }
            vis[p*t%(n*m)]=1;
            now.push_back(p*t%(n*m));
        }
        if(valid){
            if(flag)swap(a,b);
            cout<<"Yes\n";
            for(auto p:a)cout<<p<<" ";cout<<"\n";
            for(auto p:b)cout<<p<<" ";cout<<"\n";
            return ;
        }
    }
    cout<<"No\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}