#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
namespace Fread {
const int SIZE = 1 << 21;
char buf[SIZE], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, SIZE, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
}  // namespace Fread
namespace Fwrite {
const int SIZE = 1 << 21;
char buf[SIZE], *S = buf, *T = buf + SIZE;
inline void flush() {
  fwrite(buf, 1, S - buf, stdout);
  S = buf;
}
inline void putchar(char c) {
  *S++ = c;
  if (S == T) flush();
}
struct NTR {
  ~NTR() { flush(); }
} ztr;
}  // namespace Fwrite
namespace Fastio {
struct Reader {
  template <typename T>
  Reader& operator>>(T& x) {
    char c = Fread ::getchar();
    T f = 1;
    while (c < '0' || c > '9') {
      if (c == '-') f = -1;
      c = Fread ::getchar();
    }
    x = 0;
    while (c >= '0' && c <= '9') {
      x = x * 10 + (c - '0');
      c = Fread ::getchar();
    }
    x *= f;
    return *this;
  }
  Reader& operator>>(char& c) {
    c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    return *this;
  }
  Reader& operator>>(char* str) {
    int len = 0;
    char c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    while (c != '\n' && c != ' ') {
      str[len++] = c;
      c = Fread ::getchar();
    }
    str[len] = '\0';
    return *this;
  }
  Reader() {}
} cin;
const char endl = '\n';
struct Writer {
  template <typename T>
  Writer& operator<<(T x) {
    if (x == 0) {
      Fwrite ::putchar('0');
      return *this;
    }
    if (x < 0) {
      Fwrite ::putchar('-');
      x = -x;
    }
    static int sta[45];
    int top = 0;
    while (x) {
      sta[++top] = x % 10;
      x /= 10;
    }
    while (top) {
      Fwrite ::putchar(sta[top] + '0');
      --top;
    }
    return *this;
  }
  Writer& operator<<(char c) {
    Fwrite ::putchar(c);
    return *this;
  }
  Writer& operator<<(char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer& operator<<(const char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer() {}
} cout;
}  // namespace Fastio
const int MAXN = 1000;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n, m, a[MAXN + 5][MAXN + 5];
long long K;
vector<pair<int, pair<int, int> > > vec;
bool cmp(pair<int, pair<int, int> > x, pair<int, pair<int, int> > y) {
  return x.first > y.first;
}
int f[MAXN + 5][MAXN + 5];
int fa[MAXN * MAXN + 5], sz[MAXN * MAXN + 5];
bool vis[MAXN + 5][MAXN + 5];
int id(int x, int y) { return (x - 1) * m + y; }
int get_fa(int u) { return (u == fa[u]) ? u : (fa[u] = get_fa(fa[u])); }
void unite(int u, int v) {
  u = get_fa(u);
  v = get_fa(v);
  if (u != v) {
    if (sz[u] > sz[v]) swap(u, v);
    fa[u] = v;
    sz[v] += sz[u];
  }
}
long long need;
int cnt_vis;
int ans[MAXN + 5][MAXN + 5];
void dfs(int x, int y, int _min) {
  if (cnt_vis == need) return;
  ans[x][y] = _min;
  cnt_vis++;
  if (cnt_vis == need) return;
  for (int i = 0; i < 4; ++i) {
    int xx = x + dx[i];
    int yy = y + dy[i];
    if (xx < 1 || xx > n || yy < 1 || yy > m || ans[xx][yy] || a[xx][yy] < _min)
      continue;
    dfs(xx, yy, _min);
  }
}
int main() {
  Fastio ::cin >> n >> m >> K;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      Fastio ::cin >> a[i][j];
      vec.push_back(make_pair(a[i][j], make_pair(i, j)));
      fa[id(i, j)] = id(i, j);
      sz[id(i, j)] = 1;
    }
  }
  sort(vec.begin(), vec.end(), cmp);
  for (int i = 0; i < ((int)(vec).size()); ++i) {
    int j = i;
    while (j + 1 < ((int)(vec).size()) && vec[j + 1].first == vec[i].first) ++j;
    for (int k = i; k <= j; ++k) {
      int x = vec[k].second.first;
      int y = vec[k].second.second;
      for (int l = 0; l < 4; ++l) {
        int xx = x + dx[l];
        int yy = y + dy[l];
        if (xx < 1 || xx > n || yy < 1 || yy > m || !vis[xx][yy]) continue;
        unite(id(x, y), id(xx, yy));
      }
      vis[x][y] = 1;
    }
    for (int k = i; k <= j; ++k) {
      int x = vec[k].second.first;
      int y = vec[k].second.second;
      f[x][y] = sz[get_fa(id(x, y))];
    }
    i = j;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (K % a[i][j] == 0) {
        need = K / a[i][j];
        if (f[i][j] >= need) {
          Fastio ::cout << "YES" << Fastio ::endl;
          cnt_vis = 0;
          dfs(i, j, a[i][j]);
          for (int k = 1; k <= n; ++k) {
            for (int l = 1; l <= m; ++l) {
              Fastio ::cout << ans[k][l] << " \n"[l == m];
            }
          }
          return 0;
        }
      }
    }
  }
  Fastio ::cout << "NO" << Fastio ::endl;
  return 0;
}
