B.cpp

#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 300+5;

int n,m;
int a[MAXN][MAXN];

inline void Solve(){
    scanf("%d%d",&n,&m);
    FOR(i,1,n) FOR(j,1,m) scanf("%d",&a[i][j]);
    bool flag = 1;
    FOR(i,1,n){
        FOR(j,1,m){
            int t = 4;
            if(i == 1 || i == n) t--;
            if(j == 1 || j == m) t--;
            flag &= a[i][j] <= t;
        }
    }
    if(!flag){
        puts("NO");return;
    }
    puts("YES");
    FOR(i,1,n){
        FOR(j,1,m){
            int t = 4;
            if(i == 1 || i == n) t--;
            if(j == 1 || j == m) t--;
            printf("%d ",t);
        }
        puts("");
    }
}

int main(){
    int T;scanf("%d",&T);
    while(T--) Solve();
    return 0;
}