#include<bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<ll> a(n), b(m);
    for(int i = 0; i < n; i++){
        a[i] = i + 1;
    }
    for(int i = 0; i < m; i++) {
        b[i] = 1 + i * 1ll * n;
    }
    ll mod = n * 1ll * m;

    vector<bool> cont(n * m, false);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++) {
            ll c = (a[i] * b[j]) % mod;
            cont[c] = true;
        }
    }

    for(int i = 0; i < n * m; i++) {
        if(!cont[i]) {
            cout << "No\n";
            return;
        }        
    }
    cout << "Yes\n";
    for(auto x : a){
        cout << x << ' ';
    }
    cout << '\n';
    for(auto x : b){
        cout << x << ' ';
    }
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(0); cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}