#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
const int N = 1e6 + 10, mod = 1e9 + 7;
map<PII, int> ha;

string fun(int n) {
    int m = n * (n + 1) / 2;
    if (m % 2 == 1) {
        return string();
    }
    m /= 2;
    m -= n;
    vector<int> a(n + 1), ans;
    for (int i = 1; i <= n; i++) {
        a[i] = i * (i - 1) / 2;
    }
    int cnt = n;
    for (int i = n; i >= 2; i--) {
        if (m >= a[i]) {
            m -= a[i];
            cnt -= i;
            ans.push_back(i);
        }
    }
    while (cnt) {
        ans.push_back(1);
        cnt--;
    }
    string res;
    char c = '0';
    for (auto x : ans) {
        res += string(x, c);
        c = c == '0' ? '1' : '0';
    }
    return res;
}

void solve() {
    int n, m;
    cin >> n >> m;
    string s = fun(n);
    // cout << s << endl;
    if (!s.empty()) {
        cout << "Yes" << endl;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << s[i] << " ";
            }
            cout << endl;
        }
        return;
    }
    s = fun(m);
    // cout << s << endl;
    if (!s.empty()) {
        cout << "Yes" << endl;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << s[j] << " ";
            }
            cout << endl;
        }
    }
    else {
        cout << "No" << endl;
    }
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}