#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<string.h>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#pragma GCC optimize(3,"Ofast","inline")
#define endl "\n"
using namespace std;
typedef long long ll;
ll n,m;
int main()
{
	ll n,m,t;
	cin>>t;
	while(t--)
	{
			cin>>n>>m;
	if((1+n)*n/2*m*(m+1)/2%2==1)
	{
		cout<<"No"<<endl;
	}
	else
	{
		cout<<"Yes"<<endl;
		for(ll i=1;i<=n;i++)
		{
			for(ll j=1;j<=m;j++)
			{
				if(j%2==1)
				cout<<1;
				else
				cout<<0;
			}
			cout<<endl;
		}
	}
}
}