#include <bits/stdc++.h>

bool chk(int n, int m, std::vector<int> &a, std::vector<int> &b) {
    for (int i = 1; i <= n; ++i)
        a[i - 1] = (i - 1) * m + 1;
    if (n == 1) {
        for (int j = 0; j < m; ++j)
            b[j] = j;
    } else {
        for (int j = 1; j <= m; ++j)
            b[j - 1] = (j - 1) * n + 1;
    }
    std::set<int> st;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            // printf("%3d ", a[i] * b[j] % (n * m));
            st.insert(1ll * a[i] * b[j] % (n * m));
        }
        // puts("");
    }
    return st.size() == n * m;
}

int main() {

    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m;
        scanf("%d%d", &n, &m);
        if (n == 1 && m == 1) {
            puts("Yes");
            printf("%d\n%d\n", 0, 0);
            continue;
        }
        std::vector<int> a(n), b(m);
        if (!chk(n, m, a, b) && !chk(m, n, b, a)) {
            puts("No");
            continue;
        }
        puts("Yes");
        for (int i = 0; i < n; ++i) {
            printf("%d%c", a[i], " \n"[i == n - 1]);
        }
        for (int i = 0; i < m; ++i) {
            printf("%d%c", b[i], " \n"[i == m - 1]);
        }
    }
    return 0;
}