#include <bits/stdc++.h>
using namespace std;
long long way(int x) {
    return 1ll * x * (x + 1) / 2;
}

void solve() {
    auto getv = [&](int x) {
        long long w = way(x) / 2;
        vector<int> lens;
        for (int i = x; i >= 1; i--) {
            if (w >= way(i) + x) {
                lens.push_back(i);
                w -= way(i);
                break;
            }
        }
        // w >= n >= rem
        int rem = x - (lens.empty() ? 0 : lens[0]);
        while (rem < w) {
            bool ok = false;
            for (int j = 10; j >= 2; j--) {
                int ww = way(j);
                if (w - ww >= rem - j) {
                    ok = true;
                    w -= ww;
                    rem -= j;
                    lens.push_back(j);
                    break;
                }
            }
            if (!ok) {
                return vector<int>{};
            }
        }
        while (rem--) {
            lens.push_back(1);
        }
        return lens;
    };
    int n, m;
    cin >> n >> m;
    if (way(n) % 2 == 1 && way(m) % 2 == 1) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    if (way(n) % 2 == 0) {
        auto lens = getv(n);
        if (lens.empty()){
            cout<<"No\n";
            return;
        }
        int p = 0, i = 0;
        vector<int> col(n);
        for (int x : lens) {
            while (x--) col[i++] = p;
            p ^= 1;
        }
        for(int i=0;i<n;i++)for(int j=0;j<m;j++){
            cout<<col[i]<<" \n"[j+1==m];
        }
    } else {
        auto lens = getv(m);
        if (lens.empty()){
            cout<<"No\n";
            return;
        }
        int p = 0, i = 0;
        vector<int> col(m);
        for (int x : lens) {
            while (x--) col[i++] = p;
            p ^= 1;
        }
        for(int i=0;i<n;i++)for(int j=0;j<m;j++){
            cout<<col[j]<<" \n"[j+1==m];
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();    
    }
    return 0;
}