#include <bits/stdc++.h>
using namespace std;
long long way(int x) {
    return 1ll * x * (x + 1) / 2;
}

void solve() {
    int n, m;
    cin >> n >> m;    
    if (way(n) % 2 == 1 && way(m) % 2 == 1) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    if (way(n) % 2 == 0) {
        long long w = way(n) / 2;
        vector<int> lens;
        for (int i = n; i >= 3; i--) {
            if (w >= way(i)) {
                w -= way(i);
                lens.push_back(i);
                break;
            }
        }
        
        int s = lens.size() ? lens[0] : 0;
        for (int i = 0; i <= n - s; i++) {
            int p = n - s - i;
            if (p % 2 == 0) {
                int j = p / 2;
                if (i + j * 3 == w) {
                    int x = i;
                    while (x--) {
                        lens.push_back(1);
                    }
                    x = j;
                    while (x--) {
                        lens.push_back(2);
                    }
                }
            }
        }
        int i = 0;
        vector<int> col(n);
        int p = 0;
        for (int x : lens) {
            while (x--) col[i++] = p;
            p ^= 1; 
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << col[i] << " ";
            }
            cout << "\n";
        }
        return;
    }
    if (way(m) % 2 == 0) {
        long long w = way(m) / 2;
        vector<int> lens;
        for (int i = m; i >= 3; i--) {
            if (w >= way(i)) {
                w -= way(i);
                lens.push_back(i);
                break;
            }
        }
        int s = lens.size() ? lens[0] : 0;
        for (int i = 0; i <= m - s; i++) {
            int p = m - s - i;
            if (p % 2 == 0) {
                int j = p / 2;
                if (i + j * 3 == w) {
                    int x = i;
                    while (x--) {
                        lens.push_back(1);
                    }
                    x = j;
                    while (x--) {
                        lens.push_back(2);
                    }
                }
            }
        }
        int i = 0;
        vector<int> col(m);
        int p = 0;
        for (int x : lens) {
            while (x--) col[i++] = p;
            p ^= 1;
        }
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << col[j] << " ";
            }
            cout << "\n";
        }
        return;
    }
}

int main() {
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        solve();    
    }
    return 0;
}