#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i32 = int;
using i64 = long long;
using i128=__int128;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    auto solve=[&]()->void
    {
        int n, m; cin >> n >> m;
        if (gcd(n, m) != 1) return cout << "No\n", void();
        cout << "Yes\n";
        vector<int> a(n + 1);
        for (int i = 1; i <= n; i ++ ) 
            a[i] = (i - 1) * m + 1;
        vector<int> b(m + 1);
        for (int i = 1; i <= m; i ++ ) 
            b[i] = (i - 1) * n + 1;
        for (int i = 1; i <= n; i ++ ) 
            cout << a[i] % (n * m) << " \n"[i == n];
        for (int j = 1; j <= m; j ++ ) 
            cout << b[j] % (n * m) << " \n"[j == m];
        vector<int> st(n * m + 1);
        for (int i = 1; i <= n; i ++ ) 
            for (int j = 1; j <= m; j ++ ) 
                st[a[i] * b[j] % (n * m)] = 1;
        // for (int i = 1; i <= n; i ++ ) 
        //     for (int j = 1; j <= m; j ++ ) 
        //         cout << a[i] * b[j] % (n * m) << " \n"[j == m];
        for (int i = 0; i < n * m; i ++ ) 
            if (!st[i]) return cerr << i << "\n", void();
    };
    i32 t=1;
    cin>>t;
    while(t--) solve();
}