#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 5e6 + 10, M = 5010, MOD = 998244353;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;
int v1[N], v2[N];

void solve()
{
    cin >> n >> m;
    int p = n * m;
    bool flag = 0;
    if(n > m) swap(n, m), flag = 1;
    vector<LL> a(m);
    a[0] = 1;
    for(int i = 1; i < m; i ++) a[i] = (a[i - 1] + n);
    vector<int> mp(1e6 + 10);
    int cnt = 0;
    for(LL i = 1; i <= n; i ++)
        for(LL j = 0; j < m; j ++)
        {
            if(!mp[(i * a[j]) % (n * m)])
                mp[(i * a[j]) % (n * m)] = 1, cnt ++;
        }
    
    if(cnt == n * m)
    {
        if(!flag)
        {
            cout << "Yes" << endl;
            for(int i = 1; i <= n; i ++) cout << i % p <<  " ";
            cout << endl;
            for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
            cout << endl;
        }
        else 
        {
            cout << "Yes" << endl;
            for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
            cout << endl;
            for(int i = 1; i <= n; i ++) cout << i % p <<  " ";
            cout << endl;
        }
        return;
    }

    for(LL i = 0; i <= n * m; i ++) mp[i] = 0;
    cnt = 0;
    for(LL i = 1, k = 1; i <= n; i ++, k += 2)
        for(LL j = 0; j < m; j ++)
        {
            if(!mp[(k * a[j]) % (n * m)])
                mp[(k * a[j]) % (n * m)] = 1, cnt ++;
        }
    
    if(cnt == n * m)
    {
        if(!flag)
        {
            cout << "Yes" << endl;
            for(int i = 1, k = 1; i <= n; i ++, k += 2) cout << k % p <<  " ";
            cout << endl;
            for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
            cout << endl;
        }
        else 
        {
            cout << "Yes" << endl;
            for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
            cout << endl;
            for(int i = 1, k = 1; i <= n; i ++, k += 2) cout << k % p <<  " ";
            cout << endl;
        }
        return;
    }
    cout << "No" << endl;
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}