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

void solve(){
	int n;
	cin>>n;
	int m;
	cin>>m;
    long long int tot=n*(n+1ll)/2;
	if(tot%2!=0){
		tot=m*(m+1ll)/2;
		if(tot%2==0){
			tot/=2;
			tot-=m;
			int tmp=m;
			int cur=0;
			int chk=0;
			vector<int> ans;
			while(tmp--){
				if(tot-cur>=0){
					cur++;
					ans.push_back(chk);
					tot-=cur;
				}
				else{
					cur=1;
					chk=chk^1;
					ans.push_back(chk);
				}
			}
			cout<<"Yes"<<endl;
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					cout<<ans[j]<<" ";
				}
				cout<<endl;
			}
			return;
		}
		else{
			cout<<"No"<<endl;
			return;
		}
	}
	else{
		tot-=n;
		int tmp=n;
		int cur=0;
		int chk=0;
		vector<int> ans;
		while(tmp--){
			if(tot-cur>=0){
				cur++;
				ans.push_back(chk);
			}
			else{
				cur=1;
				chk=chk^1;
				ans.push_back(chk);
			}
		}
		cout<<"Yes"<<endl;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				cout<<ans[i]<<" ";
			}
			cout<<endl;
		}
			return;
	}
	
}

int main(){
	int tc=1;
	cin>>tc;
	while(tc--)solve();
	return 0;
}