#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define UQ(v) sort(be(v)), v.erase(unique(be(v)), v.end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }




void solve(){
    ll n,m;
    cin >> n >> m;
    ll sw = 0;
    if(n > m){
        swap(n, m);
        sw = 1;
    }
    VV<ll> v(n, V<ll>(m, 0));
    V<ll> a(n), b(m);
    rep(i, n) a[i] = (i+1)%(n*m);
    rep(i, m) b[i] = (1 + i*n)%(n*m);
    V<ll> cnt(n*m, 0);
    rep(i, n) rep(j, m){
        v[i][j] = a[i]*b[j]%(n*m);
        cnt[v[i][j]] ++;
        if(cnt[v[i][j]] > 1){
            cout << "No" << endl;
            return;
        }
    }
    if(sw){
        swap(n, m);
        swap(a, b);
    }
    cout << "Yes" << endl;
    for(auto x:a) cout << x << " ";
    cout << endl;
    for(auto x:b) cout << x << " ";
    cout << endl;
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    cin >> t;
    rep(i,t) solve();
}