#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
#define endl '\n'
#define pii pair<int, int>
#define cerr                                                                                                           \
    if (test) cerr
#define freopen                                                                                                        \
    if (test) freopen
#define whtest if (test)
const int test = 0;
const int N = 2e3 + 10;
const int mod = 998244353;
const int inf = 0x3f3f3f3f3f;
const ll inff = 1ll << 60;
inline int read() {
    int x;
    cin >> x;
    return x;
}
struct BIT {
    vector<int> a;
    int n;
    BIT(int m) : n(m), a(m, 0){};
    void init(int s) {
        for (int i = 1, n = s; i <= n; i++) a[i] = 0;
    }
    int lowbit(int x) {
        return x & -x;
    }
    void update(int p, int x) {
        for (; p <= n; p += lowbit(p)) a[p] += x;
    }
    int query(int p) {
        int res = 0;
        for (; p; p -= lowbit(p)) res += a[p];
        return res;
    }
    int query(int l, int r) {
        return query(r) - query(l);
    }
};

void solve() {
    int n = read(), m = read();
    vector<int> a(n), b(m);
    if (gcd(n, m) != 1) {
        cout << "No" << endl;
        return;
    }
    for (int i = 0; i < n; i++) a[i] = 1 + i * m;
    for (int i = 0; i < m; i++) b[i] = 1 + i * n;
    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < m; j++) {
    //         cout << a[i] * b[j] % (n * m) << " \n"[j == m - 1];
    //     }
    // }
    cout << "Yes" << endl;
    for (int i = 0; i < n; i++) {
        cout << a[i] << " \n"[i == n - 1];
    }
    for (int i = 0; i < m; i++) {
        cout << b[i] << " \n"[i == m - 1];
    }
}


signed main() {
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int t = 1;
    t = read();
    for (int i = 1; i <= t; ++i) {
        solve();
    }
    return 0;
}