#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
const int maxn = 100;
const int N = 1e6 + 7;
int f[51][200]{};
ll w[1000010];
int n, m;
int work(ll tot, int tp)
{
    vector<int> ans;

    ll W = (tot + 1) * tot / 4;
    ll V = tot;

    if (W < V){
        cout << "No\n";
        return -1;
    }

    while (W && V)
    {
        if (W < maxn)
            break;
        int id = upper_bound(w + 1, w + 1000001, min(W, W + 1 - V)) - w - 1; // 小于等于min(W, W + 1 - V)的
        W -= w[id] + id;
        V -= id;
        ans.push_back(id);
    }


    // W 填充的 W < maxn && W >= V
    // V 格子数
    while (W > 0 && V > 0)
    {
        int t = f[V][W];
        if(t == -1){
            cout << "No\n";
            return -1;
        }
        ll dt = t * (t + 1) / 2;
        ans.push_back(t);
        W -= dt, V -= t;
    }

    cout << "Yes\n";
    if (tp == 1)
    {
        int now = 0;
        for (auto x : ans)
        {
            for (int j = 1; j <= x; ++j)
            {
                for (int i = 1; i <= m; ++i)
                    cout << now << " ";
                cout << '\n';
            }
            now ^= 1;
            
        }
        return 1;
    }
    else
    {
        for (int i = 1; i <= n; i++)
        {
            int now = 0;
            for (auto x : ans)
            {
                for (int j = 1; j <= x; ++j)
                {
                    cout << now << " ";
                }
                now ^= 1;
            }
            cout << '\n';
        }
        return 1;
    }
}
void slv()
{
    int op = -1;
    cin >> n >> m;

    if (n % 4 == 0 || n % 4 == 3){
        op = n;
        if(work(n, 1) == 1) return;
    }
    if (m % 4 == 0 || m % 4 == 3){
        op = m;
        if(work(m, 2) == 1) return;
    }

    if (op == -1)
    {
        cout << "No\n";
        return;
    }
    return ;
}

void init()
{

    for (int i = 1; i <= 1000000; ++i)
        w[i] = (i + 1) * i / 2 - i;

    memset(f, -1, sizeof(f));
    vector<int> g(51);
    g[0] = 0;
    for (int i = 1; i <= 50; i++)
    {
        g[i] = i * (i + 1) / 2;
    }
    f[0][0] = 0;
    for (int i = 0; i <= 50; i++)
    {
        for (int j = 0; j < 101; j++)
        {
            if (f[i][j] == -1)
                continue;
            for (int k = 0; k <= 50; k++)
            {
                if (j + g[k] < 101 && i + k < 50)
                {
                    f[i + k][j + g[k]] = max(f[i + k][j + g[k]], k);
                }
            }
        }
    }
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    init();
    int _;
    cin >> _;
    while (_--)
        slv();
}
/*
3
2 3
3 2
1 1
*/