#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5, inf = 1e18, mod = 1e9 + 7;
const long double pi = 3.141592653589793238;
bool check_prime(long long n) {
  long long flag = 0, i;
  for (i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      flag = 1;
      break;
    }
  }
  if (n == 1) {
    return false;
  } else if (flag == 0 || n == 2 || n == 3) {
    return true;
  } else {
    return false;
  }
}
long long fastexpo(long long a, long long b, long long MOD) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      result = (result * a) % MOD;
    }
    a = (a * a) % MOD;
    b = b / 2;
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long testcases;
  cin >> testcases;
  while (testcases--) {
    long long n, m, i, j, f;
    cin >> n >> m;
    long long a[n][m], b[n][m];
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        cin >> a[i][j];
        b[i][j] = 3;
      }
    }
    b[0][0] = 2;
    b[0][m - 1] = 2;
    b[n - 1][0] = 2;
    b[n - 1][m - 1] = 2;
    for (i = 1; i < n - 1; i++) {
      for (j = 1; j < m - 1; j++) {
        b[i][j] = 4;
      }
    }
    f = 1;
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        if (b[i][j] < a[i][j]) {
          f = 0;
          break;
        }
      }
      if (f == 0) {
        break;
      }
    }
    if (f == 0) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
      for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
          cout << b[i][j] << " ";
        }
        cout << "\n";
      }
    }
  }
  return 0;
}
