#include <bits/stdc++.h>
#define ll long long

using namespace std;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1, 0), b(m + 1, 0);
    for (int i = 1; i <= n; i++)
        a[i] = (i - 1) * m + 1;
    for (int i = 1; i <= m; i++)
        b[i] = (i - 1) * n + 1;
    map<int, bool> mp;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            int t = 1ll * a[i] * b[j] % (1ll * n * m);
            if (mp.count(t) != 0)
            {
                cout << "No\n";
                return;
            }
            else
                mp[t] = true;
        }
    cout << "Yes\n";
    for (int i = 1; i <= n; i++)
        cout << a[i] << " \n"[i == n];
    for (int i = 1; i <= m; i++)
        cout << b[i] << " \n"[i == m];
    return;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tc;
    cin >> tc;
    while (tc--)
        solve();
    return 0;
}