#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e6 + 5;
int p, w[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    if (n % 4 == 0 || n % 4 == 3) p = n;
    else if (m % 4 == 0 || m % 4 == 3) p = m;   
    else 
    {
        cout << "No\n";
        return;
    }

    int aw = p * (p + 1) / 4;
    if (aw < p) 
    {
        cout << "No\n";
        return;
    }
    vector<int> ans;
    while (aw != p)
    {
        int t = lower_bound(w + 1, w + N, aw) - w - 1;
        if (w[t] == aw) t--;
        if (t <= 0) break;
        aw -= w[t];
        ans.push_back(t);
    }
    while (aw--) ans.push_back(1);

    cout << "Yes\n";
    if (p == n)
    {
        int now = 1;
        for (auto i: ans)
        {   
            while (i--)
            {
                for (int j = 1; j <= m; j++) cout << now << ' ';
                cout << '\n';
            }
            now ^= 1;
        }
    }
    else 
    {
        for (int i = 1; i <= n; i++)
        {
            int now = 1;
            for (auto j: ans) 
            {
                while (j--) cout << now << ' ';
                now ^= 1;
            }
            cout << '\n';
        }
    }
}   
signed main()
{
    // freopen("D:\\3022244240\\vscode\\txt\\in.txt", "r", stdin);
    // freopen("D:\\3022244240\\vscode\\txt\\out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    for (int i = 1; i < N; i++) w[i] = i * (i + 1) / 2;
    int T = 1; cin >> T;
    while (T--) solve();
    return 0;
}

/*
5
2 3
1 1
1 8
3 8
4 8
*/