#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e5 + 5;
const ll P = 998244353;
ll m, n, x;
int a[N * 10], b[N * 10];
void solve() {
    cin >> n >> m;
    vector<int> a;
    for (int ct = 1; ct <= n; ct++) {
        a.push_back((ct * m - 1) % (n * m));
    }
    vector<int> b;
    int now = 1;
    for (int ct = 1; ct <= m; ct++) {
        b.push_back(now);
        now += n;
        // now += ct - 1;
        now %= (n * m);
    }
    set<int> se;
    for (auto x : a) {
        for (auto y : b) {
            se.insert((x * y) % (n * m));
        }
    }
    if (se.size() == m * n) {
        cout << "Yes\n";
        for (auto x : a) {
            cout << x << ' ';
        }
        cout << '\n';
        for (auto x : b) {
            cout << x << ' ';
        }
        cout << '\n';
    } else {
        cout << "No\n";
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}