#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
int k;
vector<int> a;
bool dfs(int tt, long long ed) {
    if (tt == ed) {
        while (tt--) {
            a.push_back(1);
        }
        return true;
    }
    for (int t = tt; t >= 1; t--) {
        if (1ll * t * t <= ed && ed - 1ll * t * t >= tt - t && 
                1ll * (tt - t) * (tt - t) >= ed - 1ll * t * t) {
            a.push_back(t);
            if (dfs(tt - t, ed - 1ll * t * t)) return true;
            a.pop_back();
        }
    }
    return false;
}
int T, n, m;
int b[MAXN];
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        a.clear();
        if (n % 4 == 0) {
            int k = n / 4;
            long long tt = 4 * k, ed = 8ll * k * k - 2 * k;
            dfs(tt, ed);
            int tot = 0, o = 0;
            for (int i : a) {
                for (int j = 1; j <= i; j++) {
                    b[++tot] = o;
                }
                o ^= 1;
            }
            printf("Yes\n");
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    printf("%d ", b[i]);
                }
                printf("\n");
            }
        } else if (n % 4 == 3) {
            int k = (n + 1) / 4;
            long long tt = 4 * k - 1, ed = 8ll * k * k - 6 * k + 1;
            dfs(tt, ed);
            int tot = 0, o = 0;
            for (int i : a) {
                for (int j = 1; j <= i; j++) {
                    b[++tot] = o;
                }
                o ^= 1;
            }
            printf("Yes\n");
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    printf("%d ", b[i]);
                }
                printf("\n");
            }
        } else if (m % 4 == 0) {
            int k = m / 4;
            long long tt = 4 * k, ed = 8ll * k * k - 2 * k;
            dfs(tt, ed);
            int tot = 0, o = 0;
            for (int i : a) {
                for (int j = 1; j <= i; j++) {
                    b[++tot] = o;
                }
                o ^= 1;
            }
            printf("Yes\n");
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    printf("%d ", b[j]);
                }
                printf("\n");
            }
        } else if (m % 4 == 3) {
            int k = (m + 1) / 4;
            long long tt = 4 * k - 1, ed = 8ll * k * k - 6 * k + 1;
            dfs(tt, ed);
            int tot = 0, o = 0;
            for (int i : a) {
                for (int j = 1; j <= i; j++) {
                    b[++tot] = o;
                }
                o ^= 1;
            }
            printf("Yes\n");
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    printf("%d ", b[j]);
                }
                printf("\n");
            }
        } else {
            printf("No\n");
        }
    }
    return 0;
}