#include<bits/stdc++.h>
using namespace std;
#define int long long

#define ll long long
#define pb push_back
#define F first
#define S second
vector<int>solve(int n)
{
	vector<int>res;
	int X=n; ll Y=(ll)n*(n+1)/4-X;
	for(int i=n;i>=2;i--)
	{
		int x=i; ll y=(ll)i*(i+1)/2-x;
		while(Y>=y) Y-=y,X-=x,res.push_back(x);
	}
	while(X) X--,res.push_back(1);
	return res;
}
signed main(){
	int t, n, m;
	cin >> t;
	while( t -- ){
		cin >> n >> m;
		if( ((n*(n+1)/2)*(m*(m+1)/2))%2==1 ){
			cout << "No\n";
			continue;
		}
		bool change = 0;
		if( (m*(m+1)/2)%2 == 1 ){
			swap( m, n );
			change = 1;		
		}
		vector < int > vc;
		vc.clear();
		int len = m, sum = m*(m+1)/4-len;
		for(int i = m; i >= 2; i -- ){
			int s = i*(i+1)/2-i;
			while( sum >= s ){
				sum -= s;
				len -= i;
				vc.pb( i );
			}
		}
		while( len ){
			len --;
			vc.pb(1);
		}
		vector <int> v;
		int k = 0;
		for(int i : vc ){
			k = (k+1)%2;
			for(int j = 1; j <= i; j ++ ){
				v.pb( k );
			}
		}
		auto vec = solve( 12 );
		cout << "Yes\n";
		if( change ){
			for(int j : v ){
				for(int i = 1; i <= m; i ++ )
					cout << j << " ";
				cout << "\n";
			}
		}else{
			for(int i = 1; i <= n; i ++ ){
				for(int j : v )
					cout << j << " ";
				cout << "\n";
			}
		}
	}	   
}