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

using ll = long long;

int N, M;
int ans = 0;

vector<int> a, b;
void dfs(int u, int v, int A, int B) {
    if (u == 0 && v == 0) {
        set<int> s;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                s.insert(a[i] * b[j] % (N * N));
            }
        }
        if (s.size() == N * M) {
            cout << "!!!!\n";
            exit(0);
        }
        return;
    }
    for (int i = A + 1; i < N * M; i++) {
        a.push_back(i);
        dfs(u - 1, v, i, B);
        a.pop_back();
    }
    for (int i = B + 1; i < N * M; i++) {
        b.push_back(i);
        dfs(u, v - 1, A, i);
        b.pop_back();
    }
}
void init() {
    // N = 4, M = 3;
    // dfs(N, M, -1, -1);
    // cout << ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    if (n == 1 && m == 1) {
        cout << "Yes\n0\n0\n";
        return;
    }
    if (n == m) {
        cout << "No\n";
        return;
    }
    if (n < m) {
        set<int> s;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                s.insert(1ll * i * ((j-1)*n + 1) % (n * m));
            }
        }
        if (s.size() != n * m) {
            cout << "No\n";
            return;
        }
        cout << "Yes\n";
        for (int i = 1; i <= n; i++) {
            cout << i % (n * m) << " \n"[i == n];
        }
        for (int i = 1; i <= m; i++) {
            cout << ((i - 1) * n + 1) % (n * m) << " \n"[i == m];
        }
    }else {
        set<int> s;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                s.insert(1ll * i * ((j-1)*m + 1) % (n * m));
                // cerr << i * ((j-1)*m + 1) % (n * m) << " \n"[j == n];
            }
        }
        if (s.size() != n * m) {
            cout << "No\n";
            return;
        }
        cout << "Yes\n";
        for (int i = 1; i <= n; i++) {
            cout << ((i - 1) * m + 1) % (n * m) << " \n"[i == n];
        }
        for (int i = 1; i <= m; i++) {
            cout << i % (n * m) << " \n"[i == m];
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // init();
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}