#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;++i)
#define dep(i,a,b) for(int i=(a),i##_end=(b);i>=i##_end;--i)
using namespace std;
template<class T>inline T mymin(T x,T y){return x<y?x:y;}
template<class T>inline T mymax(T x,T y){return x>y?x:y;}
template <typename T>
inline void read(T &X){
    X=0;int w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=X*10+(ch^48),ch=getchar();
    if(w) X=-X;
}
const int maxn = 1e6 + 5;
//const double pi = acos(-1.0);
//const double eps = 1e-9;
//const int mo = 1e9 + 7;
int n,m,k,q;
int a[maxn],c[maxn],d[maxn];
int ans,tmp,cnt,f;
int flag;
char s[maxn];
bool ok[maxn];
int as[2][maxn];
void solve(){
    read(n);read(m);
    k = n * m;
    rep(i,0,k) d[i] = 0;
    int t = 0;
    if(n > m) {swap(n,m);t = 1;}
    if(__gcd(n,m) > 1){
        puts("No");
        return;
    }else{
        as[t][1] = as[t^1][1] = 1;
        rep(i,2,n) as[t][i] = as[t][i - 1] + m;
        rep(i,2,m) as[t^1][i] = as[t^1][i - 1] + n;
    }
    puts("Yes");
    if(t) swap(n,m);
    rep(i,1,n) printf("%d%c",as[0][i]," \n"[i == n]);
    rep(i,1,m) printf("%d%c",as[1][i]," \n"[i == m]);
    // printf("%d\n",ans);
    // cout<<"ok: "<<n<<" "<<m<<endl;
}
int main(){
    //cin.tie(0)->sync_with_stdio(false);
    int T=1,cas=1;
    read(T);
    while(T--) solve();
    return 0;
}