#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define ReadMany(arr,var,l,r) for (int var=l;var<=r;var++) cin >> arr[var];
#define PrintMany(arr,var,l,r) for (int var=l;var<=r;var++) cout << arr[var] << " \n"[var==r];
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;
int a[N], b[N];
bool ok = false;
int n,m;


void check() {
    if (ok == false) {
        cout << "pass on " << n << " ," << m << endl;
        return;
    }
        set<int> s;
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) {
                s.insert(a[i] * b[j] % (n*m));
            }
        }
        if (s.size() == n*m) {
            cout << "pass on" << n << " ," << m << endl;
        } else {
            cout << "failed on " << n << " ," << m << endl;
            assert(false);
        }
}
void solve() {
    bool reverse = false;
    if (n > m) {
        reverse = true;
        swap(n,m);
    }

    if (__gcd(n,m) > 1) {
        ok = false;
    } else {
        ok = true;
    }
    int sum = 1;
    for (int i=1;i<=n;i++) {
        reverse ? b[i] = sum: a[i] = sum;
        sum += m;
    }
    sum = 1;
    for (int i=1;i<=m;i++) {
        reverse ? a[i] = sum : b[i] = sum;
        sum += n;
    }
    if (reverse) {
        swap(n,m);
    }
    // check();

    if (!ok) {
        CNo;
    } else {
        CYes;
        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];
        }
    }
}


signed main() {
    fastIO();

//    for (n=1;n<50;n++)
//        for (m=1;m<50;m++)

    int T = 1; cin >> T;
    while (T--) {
        cin >> n >> m;
        solve();
    }


    return 0;
}