/*

_/      _/       _/_/_/      _/      _/    _/           _/_/_/_/_/
 _/    _/      _/      _/     _/    _/     _/           _/
  _/  _/      _/               _/  _/      _/           _/
   _/_/       _/                 _/        _/           _/_/_/_/
  _/  _/      _/                 _/        _/           _/
 _/    _/      _/      _/        _/        _/           _/
_/      _/       _/_/_/          _/        _/_/_/_/_/   _/_/_/_/_/

*/
#include <bits/stdc++.h>
#define ll long long
#define lc(x) ((x) << 1)
#define rc(x) ((x) << 1 | 1)
#define ru(i, l, r) for (int i = (l); i <= (r); i++)
#define rd(i, r, l) for (int i = (r); i >= (l); i--)
#define mid ((l + r) >> 1)
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define sz(s) (int)s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
#define ld long double
#define maxn 10
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());
int read() {
    int x = 0, w = 0; char ch = getchar();
    while(!isdigit(ch)) w |= ch == '-', ch = getchar();
    while(isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return w ? -x : x;
}
int a[1000005];
void doit(int n) {
    ll need = (ll)n * (n + 1) / 4 - n;
    int now = 0;
    ru(i, 1, n) {
        now ^= 1, a[i] = now;
        ru(j, 1, n - i + 1) {
            if(need < j) {
                i = i + j - 1;
                break;
            }
            else {
                need -= j;
                a[i + j] = now;
            }
        }
    }
    assert(!need);
}
void solve() {
    int n = read(), m = read();
    if((ll)n * (n + 1) % 4 == 0) {
        printf("Yes\n");
        doit(n);
        ru(i, 1, n) {
            ru(j, 1, m) printf("%d ", a[i]);
            printf("\n");
        }
    }
    else if((ll)m * (m + 1) % 4 == 0) {
        printf("Yes\n");
        doit(m);
        ru(i, 1, n) {
            ru(j, 1, m) printf("%d ", a[j]);
            printf("\n");
        }
    }
    else printf("No\n");
}
int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int T = read();
    while(T--) solve();
    return 0;
}