#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;
        int rem = x;
        for (int i = x; i >= 1; i--) {
            while (rem >= i && w - way(i) >= rem - i) {
                lens.push_back(i);
                w -= way(i);
                rem -= i;
            }
        }
        if (rem) {
            return vector<int>{};
        }
        return lens;
    };
    int n, m;
    cin >> n >> m;
    if (way(n) % 2 == 1 && way(m) % 2 == 1) {
        cout << "No\n";
        return;
    }
    if (way(n) % 2 == 0) {
        auto lens = getv(n);
        if (lens.empty()) {
            cout << "No\n";
            return;
        }
        cout << "Yes\n";
        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;
        }
        cout << "Yes\n";
        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;
}