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

const int N=1e6+10,inf=1e9;
vector<ll>e;
int a[N];
int n,m;

inline void solve(){
    
    cin >> n >> m;
    
    ll s1=1ll*(n+1)*n/2;
    ll s2=1ll*(m+1)*m/2;
    if ((s1&1)&&(s2&1)){
        cout << "No\n";
        return;
    }
    int bj=0;
    if (s2&1){
        swap(s1,s2);
        bj=1;
    }
    s2/=2;
    ll x=1;
    int r=0,o=0,mm;
    if (!bj) mm=m; else mm=n;
    
    while(s2){
        
        int p;
        if (s2==mm-r) p=1;
        else p = std::upper_bound(e.begin(), e.end(), s2) - e.begin();
        
        for(int i=r+1;i<=r+p;++i)
            a[i]=o;
        o^=1;
        s2-=e[p-1];
        r+=p;
    }
    assert(r == mm);
    // if (r!=mm){
    //     cout << "No\n";
    //     return;
    // }
    cout << "Yes\n";
    if (bj){
        for(int i=1;i<=n;++i){
            for(int j=1;j<=m;++j)
                cout << a[i] << ' ';
            cout << '\n';
        }
    }
    else{
        for(int i=1;i<=n;++i){
            for(int j=1;j<=m;++j)
                cout << a[j] << ' ';
            cout << '\n';
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    ll x=1;
    while(x<=N-10){
        e.push_back(x*(x+1)/2);
        x++;
    }

    int T;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}