#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
#define py puts("Yes")
#define pn puts("No")
#define pt puts("")
#define pb push_back
#define wt(x) write(x),puts("")
#define wr(x) write(x) ,putchar(' ')
#define tx printf("fds")
#define mp make_pair
#define fi first
#define se second
inline int read(){
	int x=0,k=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-') k=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=(x<<1)+(x<<3)+ch-48;
		ch=getchar();
	}
	return x*k;
}
void write(int x){
	if(x<0){
		x=-x;
		putchar('-');
	}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
int power(int x,int y,int mod){
	int num=1;
	while(y){
		if(y&1) num=(num*x)%mod;
		x=x*x%mod;
		y>>=1;
	}
	return num;
}
int mul(int x,int y,int mod){
	int num=0;
	while(y){
		if(y&1) num=(num+x)%mod;
		x=(x+x)%mod;
		y>>=1;
	}
	return num;
}
const int N=1e6+7,mod=998244353;
int n,m,tot,cnt,ans,k;
int a,b;
int c[N];
int st[N],top;
int get(int x){
    int l=1,r=x,p=1;
    while(l<=r){
        int mid=(l+r)>>1;
        if(mid*(mid+1)/2<=x) l=mid+1,p=mid;
        else r=mid-1;
    }
    return p;
}
signed main(){
	int tt=read();
	while(tt--){
		n=read();
        m=read();
        if((n+1)*n%8*m*(m+1)%8){
            pn;
            continue;
        }
        py;
        if(n*(n+1)%4==0){
            a=n;
        }
        else a=m;
        k=a*(a+1)/4;
        int now=a,la=1;
        top=0;
        fo(i,2,a){
            // wt(now);
            if(k>=now+(la+1)*(la+2)/2-(la)*(la+1)/2-1){
                now+=(la+1)*(la+2)/2-(la)*(la+1)/2-1;
                la++;
            }
            else{
                // wt(la);
                st[++top]=la;
                la=1;
            }
        }
        st[++top]=la;
        int now1=0,tp=0;
        fo(i,1,top){
            fo(j,1,st[i]) c[++now1]=tp;
            tp^=1;
        }

        if(n*(n+1)%4==0){
            fo(i,1,n){
                fo(j,1,m){
                    wr(c[i]);
                }
                pt;
            }
        }
        else{
            fo(i,1,n){
                fo(j,1,m){
                    wr(c[j]);
                }
                pt;
            }
        }
	}
	return 0;
}