#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define ld long double
#define no {cout << "No\n";return;}
using namespace std;
int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int NC = 2e3 + 10;
char ches[NC][NC];
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int a[N], b[N], n, m, k;
void solve() {
    cin >> n >> m;
    if(gcd(n,m) != 1) no
    
    // cout << "n = " << n << " m = " << m << endl;
    cout << "Yes\n";
    for(int i = 1,v = 1;i <= n;++i) {
        cout << v << " ";
        v += m;
    }
    cout << endl;
    
    for(int i = 1,v = 1;i <= m;++i) {
        cout << v << " ";
        v += n;
    }
    cout << endl;   
}
signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}