#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 5;
int t, n, m, a[N];
void work(int n) 
{
    ll m = (ll)n * (n - 3) / 4; int s = 0;
    while(m)
    {
        int v = sqrtl(m + m);
        if((ll)v * (v + 1) <= m + m) v++;
        for(int i = s + 1; i <= s + v; i++) a[i] = a[s] ^ 1;
        s += v; m -= (ll)v * (v - 1) / 2;
    }
    while(s < n) s++, a[s] = a[s - 1] ^ 1;
}
void solve() 
{
    scanf("%d%d", &n, &m);
    if(n % 4 == 0 || n % 4 == 3) 
    {
        work(n); printf("Yes\n");
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++) printf("%d ", a[i]);
            printf("\n");
        }
        return;
    }
    if(m % 4 == 0 || m % 4 == 3) 
    {
        work(m); printf("Yes\n");
        for(int i = 1; i <= n; i++) 
        {
            for(int j = 1; j <= m; j++) printf("%d ", a[j]);
            printf("\n");
        }
        return;
    }
    printf("No\n");
}
int main()
{
    scanf("%d", &t);
    while(t--) solve();
    return 0;
}