#include<bits/stdc++.h>
using namespace std;
const char nl = '\n';
  typedef long long ll;
  typedef long double ld;
typedef long long int lli;  
 const int MOD = 1'000'000'007;


void solve(){
int n,m;
cin >> n >> m;
 if(gcd(n,m) != 1){
    cout << "No" << nl;
    return;
 }

 cout << "Yes" << nl;
if(n > m){
    for(int i = 0;i < n;i++){
        cout << i * 2 + 1 << " ";
    }
    cout << nl;
      int j = 0;
while(j < m && (1 << j) <= n * m){
cout << (1 << j) << " ";
j++;
}
for(;j < m;j++){
    cout << 2 * m + 1 + 2 * j << " ";
}
cout << nl;
}else{
    int j = 0;
while(j < n && (1 << j) <= n * m){
cout << (1 << j) << " ";
j++;
}
for(;j < n;j++){
    cout << 2 * m + 1 + 2 * j << " ";
}
cout << nl;
for(int i = 0;i < m;i++){
    cout << i * 2 +  1 << " ";
}
cout << nl;
}

                             
}


int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int t = 1;
cin >> t;
while(t--){
    solve();
}
    return 0;
}