#include <bits/stdc++.h>
using namespace std;
using u64 = uint64_t;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int bin(long int a[], long int low, long int high, long d, long day[]) {
  if (low > high) return -1;
  long mid = (low + high) / 2;
  if (a[mid] > (a[low] + d) && (a[mid - 1] <= (a[low] + d) || day[mid - 1]) &&
      day[mid] == 0)
    return mid;
  else if (a[mid] > (a[low] + d) && day[mid] == 0)
    return bin(a, low, mid - 1, d, day);
  else
    return bin(a, mid + 1, high, d - a[mid + 1] + a[low], day);
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) return (power(((a * a)), b / 2));
  return (((a) * (power(((a * a)), b / 2))));
}
bool cmp(int a, int b) { return a > b; }
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}
u64 binpower(u64 base, u64 e, u64 m) {
  u64 ans = 1;
  base %= m;
  while (e) {
    if (e & 1) {
      ans = ans * base % m;
    }
    base = base * base % m;
    e >>= 1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  for (int X = 1; X <= t; X++) {
    int n, m;
    cin >> n >> m;
    int i, j, a[n][m];
    for (long long int i = 0; i < (n); i++)
      for (long long int j = 0; j < (m); j++) cin >> a[i][j];
    if (a[0][0] > 2 || a[n - 1][0] > 2 || a[n - 1][m - 1] > 2 ||
        a[0][m - 1] > 2) {
      cout << "NO\n";
      continue;
    }
    int ch = 1;
    for (i = 1; i < n - 1; i++) {
      if (a[i][m - 1] > 3 || a[i][0] > 3) {
        ch = 0;
        break;
      }
      a[i][m - 1] = 3, a[i][0] = 3;
    }
    if (!ch) {
      cout << "NO\n";
      continue;
    }
    for (i = 1; i < m - 1; i++) {
      if (a[0][i] > 3 || a[n - 1][i] > 3) {
        ch = 0;
        break;
      }
      a[0][i] = 3, a[n - 1][i] = 3;
    }
    if (!ch) {
      cout << "NO\n";
      continue;
    }
    for (i = 1; i < n - 1; i++) {
      for (j = 1; j < m - 1; j++) {
        if (a[i][j] > 4) {
          ch = 0;
          break;
        }
        a[i][j] = 4;
      }
    }
    if (!ch) {
      cout << "NO\n";
      continue;
    }
    cout << "YES\n";
    a[0][0] = 2, a[0][m - 1] = 2, a[n - 1][0] = 2, a[n - 1][m - 1] = 2;
    for (long long int i = 0; i < (n); i++) {
      for (long long int j = 0; j < (m); j++) cout << a[i][j] << " ";
      cout << "\n";
    }
  }
  return 0;
}
