#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long a[1005][1005];
vector<pair<long long, pair<long long, long long>>> b;
pair<long long, long long> p[1005][1005];
long long r[1005][1005];
long long cnt, val;
long long ans[1005][1005];
long long vis[1005][1005];
void create(long long x, long long y) {
  p[x][y] = {x, y};
  r[x][y] = 1;
}
pair<long long, long long> find(pair<long long, long long> x) {
  if (p[x.first][x.second] != x)
    p[x.first][x.second] = find(p[x.first][x.second]);
  return p[x.first][x.second];
}
void merge(pair<long long, long long> x, pair<long long, long long> y) {
  if (a[x.first][x.second] > a[y.first][y.second]) return;
  pair<long long, long long> px = find(x);
  pair<long long, long long> py = find(y);
  if (px == py) return;
  if (r[px.first][px.second] >= r[py.first][py.second]) {
    p[py.first][py.second] = p[px.first][px.second];
    r[px.first][px.second] += r[py.first][py.second];
  } else {
    p[px.first][px.second] = p[py.first][py.second];
    r[py.first][py.second] += r[px.first][px.second];
  }
}
void dfs(long long x, long long y) {
  if (cnt <= 0) return;
  ans[x][y] = val;
  cnt--;
  vis[x][y] = true;
  if (!vis[x - 1][y] && a[x - 1][y] >= val) dfs(x - 1, y);
  if (!vis[x + 1][y] && a[x + 1][y] >= val) dfs(x + 1, y);
  if (!vis[x][y - 1] && a[x][y - 1] >= val) dfs(x, y - 1);
  if (!vis[x][y + 1] && a[x][y + 1] >= val) dfs(x, y + 1);
}
void solve() {
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= m; j++) {
      cin >> a[i][j];
      create(i, j);
      b.push_back({a[i][j], {i, j}});
    }
  }
  sort(b.begin(), b.end());
  reverse(b.begin(), b.end());
  long long nx = 1, ny = 1;
  cnt = -1;
  pair<long long, long long> pk;
  for (auto now : b) {
    nx = now.second.first;
    ny = now.second.second;
    merge({nx, ny}, {nx + 1, ny});
    merge({nx, ny}, {nx - 1, ny});
    merge({nx, ny}, {nx, ny + 1});
    merge({nx, ny}, {nx, ny - 1});
    if (k % now.first == 0) {
      pk = find({nx, ny});
      if (k / now.first <= r[pk.first][pk.second]) {
        cnt = k / now.first;
        val = now.first;
        break;
      }
    }
  }
  if (cnt == -1) {
    cout << "NO";
    return;
  }
  cout << "YES\n";
  dfs(nx, ny);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= m; j++) cout << ans[i][j] << " ";
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tests = 1;
  while (tests--) {
    solve();
  }
  return 0;
}
