#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) x.begin(), x.end()
void solve()
{
    int n;
    cin >> n;
    int m;
    cin >> m;
    if (gcd(n, m) != 1)
    {
        cout << "No\n";
        return;
    }
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++)
    {
        a[i] = i * m + 1;
    }
    for (int i = 0; i < m; i++)
    {
        b[i] = n * i + 1;
    }
    set<int> t;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            t.insert(1ll * a[i] * b[j] % (n * m));
        }
    if(t.size()!=n*m){
        assert(0);
    }
    cout << "Yes\n";
    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()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
}
/*
1 2 3
1 4 5 7 13
1 2 3
1 4 7 10 13
1 2 3
2 5 8 11 14
1 2 3
2 8 10 11 14
1 2 6
1 4 5 7 13
1 2 6
1 4 7 10 13
1 2 6
2 5 8 11 14
1 2 6
2 8 10 11 14
1 2 9
1 4 5 7 13s
1 2 9
1 4 7 10 13
*/