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

const int N = 1e6 + 10;
typedef long long ll;
int a[N];
ll n, m;

void solve(){
    int flagg = 0;
    cin >> n >> m;
    if(m == 1 || m == 2) swap(n, m), flagg = 1;
    if(n * (n + 1) * m * (m + 1) / 4 % 2 == 1){
        cout << "No" << '\n';
        return;
    }
    int flag = 0;
    ll res = m * (m + 1) / 4;
    ll nw = m;
    int NW = 0;
    while(1){
        while(nw * (nw + 1) / 2 + m - (NW + nw) > res && nw > 1) nw --;
        res -= nw * (nw + 1) / 2;
        for(int i = 1; i <= nw; i ++) a[NW + i] = flag;
        flag = flag ^ 1; 
        NW += nw;
        if(NW >= m) break;
    }
    // cout << n << m << '\n';
    cout << "Yes" << '\n';
    if(flagg){
        for(int i = 1; i <= m; i ++){
            for(int j = 1; j <= n; j ++) cout << a[i] << ' ';
            cout << '\n';
        }
        return;
    }
    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);
    int T;
    cin >> T;
    while(T --) solve();
    return 0;
}