#define _CRT_SECURE_NO_WARNINGS 0
#include <iostream> 
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<set>
#include<queue>
#include <stack>
#include<list>
#include<cstring>
#include<cmath>
#include <cstdlib>
#include<fstream>
#include<climits>
using namespace std;
long long karr[1000005];
void solve() {
    int n, m;
    cin >> n >> m;
    if (((m * n * (m + 1) * (n + 1) ) / 4) % 2 == 0) {
        bool iswap = false;
        if ((n * (n + 1) / 2) % 2 == 0) {
            swap(m, n);
            iswap = true;
        }
        cout << "Yes" << endl;
        int total = m * (m + 1) / 4;
        vector<int> ans; 
        vector<bool> flag;
        long long sum = 1;
        bool swich = true;
        while (total > 0)
        {
            long long pos = lower_bound(karr + 1, karr + 1000000 + 1, total - m + sum) - karr;
            ans.push_back(pos);
            sum += pos;
            total -= karr[pos];
            for (int i = 0; i < pos; i++)
            {
                flag.push_back(swich);
            }
            swich = !swich;
        }
        if (iswap) {
            swap(n, m);
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < m; j++)
                {
                    printf("%d ", flag[i] ? 1 : 0);
                }
                printf("\n");
            }
        }
        else {
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < m; j++)
                {
                    printf("%d ", flag[j] ? 1 : 0);
                }
                printf("\n");
            }
        }
    }
    else {
        cout << "No" << endl;
    }
}
int main() {
    int t;
    cin >> t;
    for (int i = 1; i < 1000000; i++)
    {
        karr[i] += karr[i - 1] + i;
    }
    while (t--)
    {
        solve();
    }
    return 0;
}