Problem: The farmer Polycarp has a warehouse with hay, which can be represented as an n × m rectangular table, where n is the number of rows, and m is the number of columns in the table. Each cell of the table contains a haystack. The height in meters of the hay located in the i-th row and the j-th column is equal to an integer ai, j and coincides with the number of cubic meters of hay in the haystack, because all cells have the size of the base 1 × 1. Polycarp has decided to tidy up in the warehouse by removing an arbitrary integer amount of cubic meters of hay from the top of each stack. You can take different amounts of hay from different haystacks. Besides, it is allowed not to touch a stack at all, or, on the contrary, to remove it completely. If a stack is completely removed, the corresponding cell becomes empty and no longer contains the stack.

Polycarp wants the following requirements to hold after the reorganization:

  * the total amount of hay remaining in the warehouse must be equal to k, 
  * the heights of all stacks (i.e., cells containing a non-zero amount of hay) should be the same, 
  * the height of at least one stack must remain the same as it was, 
  * for the stability of the remaining structure all the stacks should form one connected region. 



The two stacks are considered adjacent if they share a side in the table. The area is called connected if from any of the stack in the area you can get to any other stack in this area, moving only to adjacent stacks. In this case two adjacent stacks necessarily belong to the same area.

Help Polycarp complete this challenging task or inform that it is impossible.

Input

The first line of the input contains three integers n, m (1 ≤ n, m ≤ 1000) and k (1 ≤ k ≤ 1018) — the number of rows and columns of the rectangular table where heaps of hay are lain and the required total number cubic meters of hay after the reorganization. 

Then n lines follow, each containing m positive integers ai, j (1 ≤ ai, j ≤ 109), where ai, j is equal to the number of cubic meters of hay making the hay stack on the i-th row and j-th column of the table.

Output

In the first line print "YES" (without quotes), if Polycarpus can perform the reorganisation and "NO" (without quotes) otherwise. If the answer is "YES" (without quotes), then in next n lines print m numbers — the heights of the remaining hay stacks. All the remaining non-zero values should be equal, represent a connected area and at least one of these values shouldn't be altered.

If there are multiple answers, print any of them.

Examples

Input

2 3 35
10 4 9
9 9 7


Output

YES
7 0 7 
7 7 7 


Input

4 4 50
5 9 1 1
5 1 1 5
5 1 5 5
5 5 7 1


Output

YES
5 5 0 0 
5 0 0 5 
5 0 5 5 
5 5 5 0 


Input

2 4 12
1 1 3 1
1 6 2 4


Output

NO

Note

In the first sample non-zero values make up a connected area, their values do not exceed the initial heights of hay stacks. All the non-zero values equal 7, and their number is 5, so the total volume of the remaining hay equals the required value k = 7·5 = 35. At that the stack that is on the second line and third row remained unaltered.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)2 * 1e9;
const long long MOD = (long long)1e9 + 7;
const long long p = 239;
const long long MAX_N = 1000;
const long double pi = 3.1415926535897932384626;
const long double eps = 1e-6;
long long a[MAX_N][MAX_N];
bool used[MAX_N][MAX_N];
pair<long long, long long> parent_set[MAX_N][MAX_N];
long long rank_set[MAX_N][MAX_N];
bool ok[MAX_N][MAX_N];
long long max_cnt = 0;
void make_set(long long x, long long y) {
  parent_set[x][y] = make_pair(x, y);
  ok[x][y] = true;
  rank_set[x][y] = 1;
  max_cnt = max(max_cnt, rank_set[x][y]);
}
pair<long long, long long> find_set(long long x, long long y) {
  if (parent_set[x][y] == make_pair(x, y)) return parent_set[x][y];
  parent_set[x][y] = find_set(parent_set[x][y].first, parent_set[x][y].second);
  return parent_set[x][y];
}
void union_set(long long x1, long long y1, long long x2, long long y2) {
  pair<long long, long long> p1 = find_set(x1, y1);
  pair<long long, long long> p2 = find_set(x2, y2);
  if (p1 == p2) return;
  if (rank_set[p1.first][p1.second] >= rank_set[p2.first][p2.second]) {
    parent_set[p2.first][p2.second] = p1;
    rank_set[p1.first][p1.second] += rank_set[p2.first][p2.second];
    max_cnt = max(max_cnt, rank_set[p1.first][p1.second]);
  } else {
    parent_set[p1.first][p1.second] = p2;
    rank_set[p2.first][p2.second] += rank_set[p1.first][p1.second];
    max_cnt = max(max_cnt, rank_set[p2.first][p2.second]);
  }
}
bool comp(pair<long long, pair<long long, long long> > a,
          pair<long long, pair<long long, long long> > b) {
  return a.first > b.first;
}
long long n, m;
long long need = 0;
void dfs(long long x, long long y, long long val) {
  used[x][y] = true;
  need--;
  a[x][y] = val;
  if (x > 0 && !used[x - 1][y] && a[x - 1][y] >= val && (need > 0))
    dfs(x - 1, y, val);
  if (x < n - 1 && !used[x + 1][y] && a[x + 1][y] >= val && (need > 0))
    dfs(x + 1, y, val);
  if (y > 0 && !used[x][y - 1] && a[x][y - 1] >= val && (need > 0))
    dfs(x, y - 1, val);
  if (y < m - 1 && !used[x][y + 1] && a[x][y + 1] >= val && (need > 0))
    dfs(x, y + 1, val);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long k;
  scanf("%I64d %I64d %I64d", &n, &m, &k);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) scanf("%I64d", &a[i][j]);
  vector<pair<long long, pair<long long, long long> > > b(n * m);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++)
      b[i * m + j] = make_pair(a[i][j], make_pair(i, j));
  sort(b.begin(), b.end(), comp);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) ok[i][j] = false;
  long long ans = -1, ans1 = -1, ans2 = -1;
  for (long long t = 0; t < n * m; t++) {
    pair<long long, long long> p = b[t].second;
    long long num = b[t].first;
    long long i = p.first, j = p.second;
    make_set(i, j);
    if (i > 0 && ok[i - 1][j]) union_set(i, j, i - 1, j);
    if (i < n - 1 && ok[i + 1][j]) union_set(i, j, i + 1, j);
    if (j > 0 && ok[i][j - 1]) union_set(i, j, i, j - 1);
    if (j < m - 1 && ok[i][j + 1]) union_set(i, j, i, j + 1);
    if (k % num == 0) {
      p = find_set(i, j);
      if (rank_set[p.first][p.second] >= k / num) {
        ans = num;
        ans1 = i;
        ans2 = j;
        break;
      }
    }
  }
  if (ans == -1) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) used[i][j] = false;
  need = k / ans;
  dfs(ans1, ans2, ans);
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++)
      if (used[i][j])
        printf("%I64d ", ans);
      else
        printf("%I64d ", (long long)0);
    printf("\n");
  }
  return 0;
}