#include<bits/stdc++.h>
#define ll long long
#define N 305
using namespace std;
struct node{
    ll t,n,w;
}edge[N*N<<1];
ll a[N][N],b[N][N],dis[N<<1],head[N<<1],cn=-1,cnt[N<<1],n,m;
bool vis[N<<1],p;
queue<ll>q;
ll read(){char c=getchar();
    ll n=0;
    while(c<'0'||c>'9')c=getchar();
    while(c<='9'&&c>='0')n=(n<<1)+(n<<3)+c-'0',c=getchar();
    return n;
}
void add(ll a,ll b,ll c){
    edge[++cn]={b,head[a],c};
    head[a]=cn;
}
int main(){ll i,k,t,f;
    t=read();
    while(t--){n=read(),m=read(),p=true;
        while(!q.empty())q.pop();
        memset(head,-1,sizeof(head)),cn=-1;
        for(i=1;i<n;i++)for(k=1;k<m;k++)b[i][k]=read();
        for(i=2;i<=n;i++){
            for(k=2;k<=m;k++){
                a[i][k]=b[i-1][k-1]-a[i-1][k-1]-a[i-1][k]-a[i][k-1];
            }
        }
        for(i=1;i<=n;i++){
            for(k=1;k<=m;k++){
                if((i&1)==(k&1)){
                    add(i,k+n,a[i][k]);
                    add(k+n,i,1e6-a[i][k]);
                }
                else{
                    add(i,k+n,1e6-a[i][k]);
                    add(k+n,i,a[i][k]);
                }
            }
        }
        memset(dis,0x3f,sizeof(dis)),memset(cnt,0,sizeof(cnt)),memset(vis,0,sizeof(vis));
        dis[1]=0;
        q.push(1),vis[1]=true;
        while(!q.empty()&&p){f=q.front(),q.pop(),vis[f]=false;
            for(i=head[f];i!=-1;i=edge[i].n){
                if(dis[edge[i].t]>dis[f]+edge[i].w){
                    dis[edge[i].t]=dis[f]+edge[i].w,cnt[edge[i].t]++;
                    if(cnt[edge[i].t]>n+m){
                        p=false;
                        break;
                    }
                    if(!vis[edge[i].t])q.push(edge[i].t),vis[edge[i].t]=true;
                }
            }
        }
        if(!p){
            cout<<"NO\n";
            continue;
        }
        cout<<"YES\n";
        for(i=1;i<=n;i++){
            for(k=1;k<=m;k++){
                if((i&1)==(k&1))a[i][k]+=dis[i]-dis[k+n];
                else a[i][k]+=dis[k+n]-dis[i];
                cout<<a[i][k]<<' ';
            }
            cout<<'\n';
        }
    }
}