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

using i64 = long long;
#define int long long

vector<i64> f(1000011);

void solve() {
    int n, m; cin>>n>>m;
    
    if(n%4 == 3 or n%4 == 0) {
        int sum = 0;
        i64 x = f[n+1]/2 - n;
        vector<int> ans;
        while(x) {
            auto it = upper_bound(f.begin()+1, f.end(), x);
            it--;
            ans.push_back(it - f.begin());
            sum += it - f.begin();
            x -= *it;
        }
        
        while(sum < n) {
            ans.push_back(1);
            sum++;
        }
        
        int t = 0, now = 0;
        vector<int> res(n+1);
        for(auto x: ans) {
            for(int i=1; i<=x; ++i) {
                res[++now] = t;
            }
            t ^= 1;
        }
        
        cout<<"Yes\n";
        for(int i=1; i<=n; ++i) {
            for(int j=1; j<=m; ++j) {
                cout<<res[i]<<" \n"[j==m];
            }
        }
        return ;
    }
    if(m%4 == 3 or m%4 == 0) {
        i64 x = f[m+1]/2 - m;
        int sum = 0;
        vector<int> ans;
        while(x) {
            auto it = upper_bound(f.begin()+1, f.end(), x);
            it--;
            ans.push_back(it - f.begin());
            sum += it - f.begin();
            x -= *it;
        }
        
        while(sum < m) {
            ans.push_back(1);
            sum++;
        }
        
        int t = 0, now = 0;
        vector<int> res(m+1);
        for(auto x: ans) {
            for(int i=1; i<=x; ++i) {
                res[++now] = t;
            }
            t ^= 1;
        }
        
        cout<<"Yes\n";
        for(int i=1; i<=n; ++i) {
            for(int j=1; j<=m; ++j) {
                cout<<res[j]<<" \n"[j==m];
            }
        }
        return ;
    }
    cout<<"No\n";
}

signed main(void) {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    
    for(i64 i=1; i<=1000010; ++i) {
        f[i] = i * (i-1)/2;
    }
    
    int t=1; cin>>t;
    while (t--) solve();
    return 0;
}