#include <bits/stdc++.h>

using namespace std;

#define int long long
bool check(int n, int m, vector<int> a, vector<int> b) {
    std::set<int> st;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            st.insert(a[i] * b[j] % (n * m));
        }
    }
    if (st.size() != n * m) {
        // std::cerr << "WA" << std::endl;
        return false;
    }
    return true;
}
void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<int> a(n + 1);
    std::vector<int> b(m + 1);

    a[1] = b[1] = 1;
    for (int i = 2; i <= n; i++) {
        a[i] = a[i - 1] + m;
    }
    for (int i = 2; i <= m; i++) {
        b[i] = b[i - 1] + n;
    }

    auto is = check(n, m, a, b);

    if (is) {
        std::cout << "Yes\n";
        for (int i = 1; i <= n; i++) {
            std::cout << a[i] << " \n"[i == n];
        }
        for (int i = 1; i <= m; i++) {
            std::cout << b[i] << " \n"[i == m];
        }
    } else {
        std::cout << "No\n";
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int t = 1;
    std::cin >> t;

    while (t --) {
        solve();
    }
}