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

int T,n,m;
vector<int>ans,pans;
bool solve(int n,long long m){
    if(m<n)return 0;
    if(m==n){
        for(int i=0;i<n;++i)
            ans.push_back(i);
        return 1;
    }
    //x*x+(n-x)*(n-x) >= m
    int u=sqrt(m);
    while((long long)u*u+(long long)(n-u)*(n-u)<=m)++u;
    for(int i=u;i>=1;--i){
        ans.push_back(i);
        if(solve(n-i,m-(long long)i*i))
            return 1;
        ans.pop_back();
    }
    return 0;
}

void work(int n,int m,int flag=0){
    int z=flag?m:n;
    ans.clear();
    solve(z,(long long)z*(z-1)/2);
    int op=1;
    pans.clear();
    for(int i:ans){
        op^=1;
        for(int j=0;j<i;++j)
            pans.push_back(op);
    }
    for(int i=0;i<n;++i)
        for(int j=0;j<m;++j)
            cout<<pans[flag?j:i]<<" \n"[j==m-1];

}

int main(){
    ios::sync_with_stdio(0);
    for(cin>>T;T --> 0;){
        cin>>n>>m;
        int s=0;
        if(n%4==3||n%4==0)
            work(n,m);
        else
        if(m%4==3||m%4==0)
            work(n,m,1);
        else{
            cout<<"NO"<<endl;
            continue;
        }

    }
    return 0;
}