#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while(c != EOF and !isdigit(c))
	{
		if(c == '-')f = -1;
		c = getchar();
	}
	while(isdigit(c))
	{
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}

int isprime(int x)
{
	for(int i = 2;i * i <= x;i ++)if(x % i == 0)return i;
	return x;
}
int n, m;
signed main()
{
	int T = read();
	while(T --)
	{
		n = read();
		m = read();
		if(n == 1)
		{
			cout<<"Yes\n"<<"1\n";
			for(int i = 0;i < m;i ++)cout<<i<<' ';
			cout<<endl;
			continue;
		}
		if(m == 1)
		{
			cout<<"Yes\n";
			for(int i = 0;i < n;i ++)cout<<i<<' ';
			cout<<endl;
			cout<<"1\n";
			continue;
		}
		int d = __gcd(n, m), k = isprime(max(n, m));
		if(d != 1 or min(n, m) >= k)
		{
			cout<<"No\n";
			continue;
		}
		cout<<"Yes\n";
		if(n < m)
		{
			for(int i = 1;i <= n;i ++)cout<<i<<' ';
			cout<<'\n';
			for(int i = 0;i < m;i ++)cout<<1+i*n<<' ';
			cout<<endl;
		}
		else 
		{
			for(int i = 0;i < n;i ++)cout<<1+i*m<<' ';
			cout<<'\n';
			for(int i = 1;i <= m;i ++)cout<<i<<' ';
			cout<<endl;
		}
	}
	return 0;
}
//ka=kb(mod m) k (0-n)
//8
//1 2 3 1 3 4 3