#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define all(x) (x).begin(), (x).end()
#define x first
#define y second
#define endl "\n" 
// #define int long long
#define sz(x) ((int)(x).size())
#define lowbit(x) ((x) & -(x))
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,x,y) for(int i = x;i<y;i++)
#define reb(i,x,y) for(int i = x;i<=y;i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
typedef long double ld;
const int N = 1e5+10, M = 2e7+10, mod = 1e6+7 , inf = 0x7fffffff;
const ld eps = 1e-12;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}



inline void solve() {
    int n, m;
    cin>>n>>m;
    if(gcd(n, m)!=1){
        cout<<"No"<<endl;
        return;
    }

    cout<<"Yes"<<endl;
    if(n==1){
        cout<<1<<endl;
        for(int i = 0;i<m;i++){
            cout<<i<<" ";
        }
        cout<<endl;
        return;
    } else if(m==1){
        for(int i = 0;i<m;i++){
            cout<<i<<" ";
        }
        cout<<endl;
        cout<<1<<endl;
        return;
    }

    vector<int>a, b;
    for(int i = 1;i<=n*m;i+=min(n, m)){
        b.push_back(i);
    }
    for(int i = 1;i<=min(n,m);i++){
        a.push_back(i);
    }

    if(n>m){
        for(auto i:b){
            cout<<i<<" ";
        }
        cout<<endl;
        for(auto i:a){
            cout<<i<<" ";
        }
        cout<<endl;
    } else {
        for(auto i:a){
            cout<<i<<" ";
        }
        cout<<endl;
        for(auto i:b){
            cout<<i<<" ";
        }
        cout<<endl;
    }
}


signed main(){
    IOS;
    cout << fixed << setprecision(10);
    int __ = 1;
    cin>>__;
    while(__--) solve();
    return 0;
}