#include <bits/stdc++.h>

auto stru(int n) {
    long long aim = n * (n + 1) / 4 - n;
    std::vector<int> seq;
    bool last = true;
    for (int i = n; i >= 2; i--)
        while (aim >= 1ll * i * (i - 1) / 2) {
            for (int _ = 0; _ < i; _++)
                seq.push_back(last ^ 1);
            last ^= 1;
            aim -= 1ll * i * (i - 1) / 2;
        }
    while (seq.size() < n)
        seq.push_back(last ^ 1),
        last ^= 1;
    return seq;
}

int main() {
    int T; std::cin >> T; while (T--) {
        int n, m;
        std::cin >> n >> m;
        if (1ll * n * (n + 1) / 2 % 2 and 1ll * m * (m + 1) / 2 % 2) {
            puts("No");
            continue;
        } else if (1ll * m * (m + 1) / 2 % 2) {
            auto seq = stru(n);
            puts("Yes");
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++)
                    printf("%d%c", seq[i], " \n"[j == m - 1]);
        } else {
            auto seq = stru(m);
            puts("Yes");
            for (int _ = 0; _ < n; _++)
                for (int i = 0; i < m; i++)
                    printf("%d%c", seq[i], " \n"[i == m - 1]);
        }
    }
    return 0;
}