#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define lowbit(x) = ((x)& - (x))
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define x first
#define y second
using namespace std;
typedef long long ll;

ll fastPow(ll a, ll n, ll mod){
    ll ans = 1;
    a %= mod;
    while(n) {
        if(n & 1)   ans = (ans*a) % mod;
        a = (a*a) % mod;
        n >>= 1;
    }
    return ans;
}

int gcd(int a, int b) {
  while (b != 0) {
    int tmp = a;
    a = b;
    b = tmp % b;
  }
  return a;
}

/*int sum(int x){
	int ans = 0;
	while(x>0){
		ans+=tree[x];
		x-=lowbit(x);
	}
	return ans;
}

void update(int x,int d){
	while(x<=//N){
		tree[x]+=d;
		x+=lowbit(x)
	}
}*/
const int N = 1e6+5;
int a[N],b[N];
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int t;cin>>t;
	int m,n;
	while(t--){
		cin>>n>>m;
		if(gcd(n,m)!=1){
			cout<<"No\n";
			continue;
		}
		cout<<"Yes\n";
		rep(i,0,n-1)cout<<1+i*m<<' ';cout<<'\n';
		rep(i,0,m-1)cout<<1+i*n<<' ';cout<<'\n';
		
	}
	return 0;
}