#include <bits/stdc++.h>

#define int long long
#define pii std::pair<int, int>
#define endl '\n'
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 1e18;
const double eps = 1e-8;




void solve() {
    int n,m;
    cin>>n>>m;
    vector<int> lie(n+1);
    vector<int> hang(m+1);
    for(int i=1;i<=n;i++){
        lie[i]=(i-1)*m+1;
    }
    for(int i=1;i<=m;i++){
        hang[i]=(i-1)*n+1;
    }
    set<int> a;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a.find(lie[i]*hang[j]%(n*m))!=a.end()){
                cout<<"No"<<endl;
                return;
            }
            a.insert(lie[i]*hang[j]%(n*m));
        }
    }
    cout<<"Yes"<<endl;
    for(int i=1;i<=n;i++){
        cout<<lie[i]<<" ";
    }
    cout<<endl;
    for(int i=1;i<=m;i++){
        cout<<hang[i]<<" ";
    }
    cout<<endl;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0); std::cout.tie(0);
    //freopen("test.in", "r",stdin);
    //freopen("test.out", "w",stdout);
    int T = 1;
    std::cin >> T;
    while (T--) {
        solve();
    }
}