#include <bits/stdc++.h>
using namespace std;
#define int long long
int W;
void Solve()
{
    W++;
    int n, m;
    cin >> n >> m;
    // n = (W - 1) / 5 + 1;
    // m = (W - 1) % 5 + 1;
    int mod = n * m;
    vector<int> a(n + 1), b(m + 1);
    auto check = [&]() -> int
    {
        vector<int> mp(n * m + 1);
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                int val = a[i] * b[j] % mod;
                if (!mp[val])
                    mp[val] = 1;
                else
                    return 0;
            }
        }
        return 1;
    };
    auto print = [&]() -> void
    {
        cout << "Yes" << "\n";
        for (int i = 1; i <= n; i++)
            cout << a[i] << " ";
        cout << "\n";
        for (int i = 1; i <= m; i++)
            cout << b[i] << " ";
        cout << "\n";
    };
    a[1] = b[1] = 1;
    for (int i = 2; i <= n; i++)
        a[i] = a[i - 1] + n - 1;
    for (int i = 2; i <= m; i++)
        b[i] = b[i - 1] + i - 1;
    for (int i = 1; i <= n; i++)
        a[i] %= mod;
    for (int i = 1; i <= m; i++)
        b[i] %= mod;
    if (check())
    {
        print();
        return;
    }
    for (int i = 2; i <= n; i++)
        a[i] = a[i - 1] + i - 1;
    for (int i = 2; i <= m; i++)
        b[i] = b[i - 1] + m - 1;
    for (int i = 1; i <= n; i++)
        a[i] %= mod;
    for (int i = 1; i <= m; i++)
        b[i] %= mod;
    if (check())
        print();
    else
        cout << "No" << "\n";
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        Solve();
    return 0;
}
/*
5
2 2
2 3
3 3
3 4
4 5

*/