// Created by YuanGodFollower 
// Time : 2024-11-06 15:30:38
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define debug(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cout << vars << " = ";
    string delim = "";
    (..., (cout << delim << values, delim = ", "));
    cout<<'\n';
}
#else
#define debug(...) (void)0
#endif
#define int long long
using ll = long long;
const int N = 1e6;
const int INF = 1e9 + 10;
const int upb = sqrt((N * N + N) / 2 + 1);

int closest(int x)
{
    int l = 1, r = upb;
    while(l + 1 < r)
    {
        int mid = l + r >> 1;
        if((mid + 1) * mid <= x) l = mid;
        else r = mid;
    }
    return l;
}

void solve()
{
    int n,m;cin>>n>>m;
    int no = 0;
    int jd = (((n * n) + n) / 2) * (((m * m) + m) / 2);
    if(jd % 2 == 1)
    {
        cout<<"No\n";
    }
    else
    {
        int sm = m * m + m;
        sm /= 2;
        vector<int> ans;
        if(sm == 2 * m) ans = vector<int>(m,1);
        else
        {
            while(sm > 1)
            {
                int sub = closest(sm);
                ans.push_back(sub);
                sm -= (sub + 1) * sub;
            }

        }
        // for(auto&& i : ans) cout<<i<<' ';
        // cout<<'\n';

        int sum = 0;
        for(auto&& i : ans) sum += i;
        if(sum != m)
        {
            no++;
        }
        else
        {
            vector<int> ot;
            int outpt = 1;
            for(auto&& i : ans)
            {
                for(int j = 0;j < i;j++)
                {
                    ot.push_back(outpt);
                }
                outpt ^= 1;
            }

            cout<<"Yes\n";
            for(int i = 0;i < n;i++)
            {
                for(int j = 0;j < m;j++)
                {
                    cout<<ot[j]<<' ';
                }
                cout<<'\n';
            }
        }

        if(no == 0) return;

        swap(n,m);
        sm = m * m + m;
        // cerr<<sm;
        ans = vector<int>();
        sm /= 2;
        if(sm == 2 * m) ans = vector<int>(m,1);
        else
        {
            while(sm > 1)
            {
                int sub = closest(sm);
                ans.push_back(sub);
                sm -= (sub + 1) * sub;
            }

        }

        // for(auto&& i : ans) cout<<i<<" ";
        // cout<<'\n';

        sum = 0;
        for(auto&& i : ans) sum += i;
        if(sum != m)
        {
            no++;
        }
        else
        {
            vector<int> ot;
            int outpt = 1;
            for(auto&& i : ans)
            {
                for(int j = 0;j < i;j++)
                {
                    ot.push_back(outpt);
                }
                outpt ^= 1;
            }

            cout<<"Yes\n";
            for(int j = 0;j < m;j++)
            {
                for(int i = 0;i < n;i++)
                {
                    cout<<ot[j]<<' ';
                }
                cout<<'\n';
            }

            
        }

        if(no == 1) return;

        cout<<"No\n";



    }
    
}

signed main()
{
    cin.tie(0)->sync_with_stdio(false);
    int t;cin>>t;
    while(t--) solve();
}