#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B, typename C>
struct triple {
  A X;
  B Y;
  C Z;
  triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}
};
template <typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
  return triple<A, B, C>(a, b, c);
}
template <typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
  if (a.X != b.X) return a.X < b.X;
  if (a.Y != b.Y) return a.Y < b.Y;
  return a.Z < b.Z;
}
template <typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
  ofs << "( " << p.first << " , " << p.second << " )";
  return ofs;
}
template <typename T>
void print(T a) {
  for (auto i : a) cout << i << ' ';
  cout << '\n';
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
signed main() {
  srand(time(NULL));
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  long long t;
  cin >> t;
  vector<vector<long long> > no(1, vector<long long>(1, -1));
  auto solve = [&]() {
    long long n, m;
    cin >> n >> m;
    vector<vector<long long> > a(n, vector<long long>(m)),
        mn(n, vector<long long>(m));
    for (long long i = 0; i < (n); i++)
      for (long long j = 0; j < (m); j++) cin >> a[i][j];
    if (a[0][0] > 2 || a[n - 1][0] > 2 || a[0][m - 1] > 2 ||
        a[n - 1][m - 1] > 2)
      return no;
    for (long long i = 1; i + 1 < n; i++)
      if (a[i][0] > 3 || a[i][m - 1] > 3) return no;
    for (long long i = 1; i + 1 < m; i++)
      if (a[0][i] > 3 || a[n - 1][i] > 3) return no;
    for (long long i = 0; i < (n); i++)
      for (long long j = 0; j < (m); j++)
        if (a[i][j] > 4) return no;
    a[0][0] = a[n - 1][0] = a[0][m - 1] = a[n - 1][m - 1] = 2;
    for (long long i = 1; i + 1 < n; i++) a[i][0] = a[i][m - 1] = 3;
    for (long long i = 1; i + 1 < m; i++) a[0][i] = a[n - 1][i] = 3;
    for (long long i = 1; i + 1 < n; i++)
      for (long long j = 1; j + 1 < m; j++) a[i][j] = 4;
    return a;
  };
  for (long long _ = 0; _ < (t); _++) {
    auto v = solve();
    if (v[0][0] < 0)
      cout << "NO\n";
    else {
      cout << "YES\n";
      for (long long i = 0; i < ((long long)(v.size())); i++) {
        for (long long j = 0; j < ((long long)(v[0].size())); j++)
          cout << v[i][j] << ' ';
        cout << '\n';
      }
    }
  }
}
