#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll num[1000003];

void solve() {
    ll n, m;
    cin >> n >> m;

    ll tot = n * (n + 1LL) / 2LL;
    int fl = 0;
    if (tot % 2) fl = 1;
    tot *= m * (m + 1LL) / 2LL;

    if (tot & 1) {
        cout << "No\n";
        return;
    }

    ll k = n;
    if (fl) k = m;
    // cerr << k << '\n';
    ll tar = k * (k + 1LL) / 4LL;
    vector<int> a;

    while (true) {
        if (!tar) break;
        auto t = upper_bound(num + 1, num + 1 + 1000000, tar) - num - 1;
        while (true) {
            ll lst1 = tar - (ll)t * ((ll)t + 2LL) / 2LL;
            ll lst2 = k - t;
            if (lst1 >= lst2) {
                a.emplace_back(t);
                tar = lst1;
                k = lst2;
                break;
            }
            t--;
        }
    }

    // for (int i = 0; i < ssize(a); ++i) {
    //     cerr << a[i] << " \n"[i == ssize(a) - 1];
    // }

    cout << "Yes\n";
    int row = m;
    if (fl) row = n;
    for (int i = 1; i <= row; ++i) {
        int out = 1;
        for (auto cnt : a) {
            for (int j = 1; j <= cnt; ++j) {
                cout << out << " ";
            }
            out ^= 1;
        }
        cout << '\n';
    }
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    for (int i = 1; i <= 1000000; ++i) {
        num[i] = num[i - 1] + (ll)i;
    }
    // for (int i = 1; i <= 10; ++i) {
    //     cerr << num[i] << " \n"[i == 10];
    // }
    
    int _;
    cin >> _;
    while (_--) solve();
    
    return 0;
}