// 
#include<bits/stdc++.h>
#define lowbit(x) ((x)&-(x))
using namespace std;
mt19937_64 myrand(407223);
using LL=long long;
using uint=unsigned;
using pii=pair<int,int>;
using vi=vector<int>;
using vp=vector<pii>;
template<typename T>inline void read(T&t){
    t=0;
    char c=getchar();
    int f=1;
    while (!isdigit(c)) f=c=='-'?-f:f,c=getchar();
    while (isdigit(c)) t=(t<<3)+(t<<1)+c-'0',c=getchar();
    t*=f;
    return;
}
template<typename T,typename...Args>inline void read(T&t,Args&...args){read(t),read(args...);}
template<typename T>void write(T x){if(x>=10)write(x/10);putchar(x%10+'0');return;}
template<typename T>inline bool chkmax(T&x,T y) {return y>x?(x=y,1):0;}
template<typename T>inline bool chkmin(T&x,T y) {return y<x?(x=y,1):0;}

const int N=1000005;

int a[N],tot;

inline LL pw(int x) {
    return 1ll*x*(x+1)/2-x;
}

inline void Gen(int n) {
    tot=0;
    LL need=1ll*n*(n+1)/4-n;
    int col=0;
    while (need) {
        int t=1;
        for (int i=20;i>=0;i--) {
            if (pw(t+(1<<i))<=need) t+=(1<<i);
        }
        // printf("%d\n",t);
        for (int i=1;i<=t;i++) a[++tot]=col;
        col^=1,need-=pw(t);
    }
    for (int i=tot+1;i<=n;i++) a[i]=col,col^=1;
    // printf("%d\n",tot);
}

inline void solve() {
    int n,m;
    read(n,m);
    LL mn=1ll*n*(n+1)/2,mm=1ll*m*(m+1)/2;
    if (mn*mm%2==1) {
        puts("No");
        return;
    }
    puts("Yes");
    if (mn%2==1) {
        Gen(m);
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) {
                printf("%d ",a[j]);
            }
            puts("");
        }
    } else {
        Gen(n);
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) {
                printf("%d ",a[i]);
            }
            puts("");
        }
    }
}

int main() {
    int T;
    read(T);
    while (T--) solve();
    return 0;
}