#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = 1e-10;
inline int read() {
  static char ch;
  bool sgn = false;
  while (ch = getchar(), ch < '0' || ch > '9')
    if (ch == '-') sgn = true;
  int res = ch - 48;
  while (ch = getchar(), ch >= '0' && ch <= '9') res = res * 10 + ch - 48;
  return sgn ? -res : res;
}
const int N = 1e3 + 2;
int n, m, t, a[N][N], f[N * N], sum[N * N], dx[4] = {1, -1, 0, 0},
                                            dy[4] = {0, 0, 1, -1};
vector<pair<int, int> > b;
bool bo[N][N], co[N][N], ok;
long long k, p[N * N], ans[N][N];
bool cmp(pair<int, int> i, pair<int, int> j) {
  return a[i.first][i.second] < a[j.first][j.second];
}
void prepare() {
  int L = ((n * m) > (sqrt(k)) ? (sqrt(k)) : (n * m));
  for (int i = 1; i <= L; i++) {
    if (k % i == 0) {
      p[++t] = i;
      if (k / i <= n * m && k / i != i) p[++t] = k / i;
    }
  }
  sort(p + 1, p + 1 + t);
}
int now;
void dfs(int x, int y, int tar) {
  co[x][y] = 1;
  if (now == tar) {
    ok = 1;
    return;
  }
  for (int i = 0; i < 4; i++) {
    int xx = x + dx[i], yy = y + dy[i];
    if (bo[xx][yy] && !co[xx][yy]) now++, dfs(xx, yy, tar);
    if (ok) return;
  }
}
void dfs1(int x, int y, int tar) {
  bo[x][y] = 0;
  ans[x][y] = k / tar;
  if (now == tar) {
    ok = 1;
    return;
  }
  for (int i = 0; i < 4; i++) {
    int xx = x + dx[i], yy = y + dy[i];
    if (bo[xx][yy]) now++, dfs1(xx, yy, tar);
    if (ok) return;
  }
}
int main() {
  n = read();
  m = read();
  cin >> k;
  b.push_back(make_pair(0, 0));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      a[i][j] = read();
      b.push_back(make_pair(i, j));
    }
  }
  sort(b.begin(), b.end(), cmp);
  prepare();
  for (int i = t; i >= 1; i--) {
    long long v = k / p[i];
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= m; k++) bo[j][k] = co[j][k] = false;
    int tot = 0;
    for (int j = n * m; j >= 1; j--) {
      int x = b[j].first, y = b[j].second;
      if (a[x][y] < v) break;
      ++tot;
      bo[x][y] = 1;
    }
    if (tot < p[i]) continue;
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= m; k++)
        if (a[j][k] == v && !co[j][k]) {
          now = 1;
          dfs(j, k, p[i]);
          if (ok) {
            ok = 0;
            now = 1;
            dfs1(j, k, p[i]);
            puts("YES");
            for (int k = 1; k <= n; k++) {
              for (int l = 1; l <= m; l++) printf("%d ", (int)ans[k][l]);
              puts("");
            }
            return 0;
          }
        }
  }
  puts("NO");
}
