#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t; cin >> t;
    while (t--) {
        long long n, m; cin >> n >> m;
        long long tot_rects = n * (n + 1) / 2 * m * (m + 1) / 2;
        if (tot_rects & 1) {
            cout << "No\n";
            continue;
        }

        auto get = [](long long x) {
            long long req_sum = x * (x + 1) / 4, req_len = x;
            vector <long long> groups;
            /*
            x * (x + 1) / 2 + (L - x) <= S

            */
            while (req_len > 0 and req_sum > 0) {
                long long l = 1, r = 1e8;
                while (r - l > 1) {
                    long long mid = (l + r) >> 1;
                    if (mid * (mid + 1) / 2 + (req_len - mid) <= req_sum) l = mid;
                    else r = mid;
                }
                // for (long long opt = req_len; opt > 0; --opt) {
                //     long long rest_ones = req_len - opt;
                //     if (opt <= req_len and opt * (opt + 1) / 2 + rest_ones <= req_sum) {
                groups.push_back(l);
                req_len -= l;
                req_sum -= l * (l + 1) / 2;
                //         break;
                //     }
                // }
            }
            assert(req_len == 0 and req_sum == 0);
            vector <int> ret;
            int st = 0;
            for (auto x : groups) {
                for (int i = 0; i < x; ++i) ret.push_back(st);
                st ^= 1;
            }
            return ret;
        };

        if (n * (n + 1) / 2 % 2 == 0) {
            cout << "Yes\n";
            auto f = get(n);
            vector <vector <int>> a(n, vector <int>(m));
            for (int i = 0; i < m; ++i) {
                for (int j = 0; j < n; ++j) {
                    a[j][i] = f[j];
                }
            }
            for (auto v : a) {
                for (auto x : v) {
                    cout << x << ' ';
                }
                cout << '\n';
            }
        } else if (m * (m + 1) / 2 % 2 == 0) {
            cout << "Yes\n";
            auto f = get(m);
            vector <vector <int>> a(n, vector <int>(m));
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < m; ++j) {
                    a[i][j] = f[j];
                }
            }
            for (auto v : a) {
                for (auto x : v) {
                    cout << x << ' ';
                }
                cout << '\n';
            }
        } else assert(0);
    }   
}