#include <bits/stdc++.h>
using namespace std;

int v, rv, n, m, k;
int a[101][101];

void dfs(int x, int y) {
  if (a[x][y] != rv) return;
  a[x][y] = v;
  k++;

  if (x > 0 && a[x - 1][y] == rv) dfs(x - 1, y);
  if (x < n - 1 && a[x + 1][y] == rv) dfs(x + 1, y);
  if (y > 0 && a[x][y - 1] == rv) dfs(x, y - 1);
  if (y < m - 1 && a[x][y + 1] == rv) dfs(x, y + 1);
}

int main() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  int xs, ys;
  cin >> n >> m >> ys >> xs >> v;
  k = 0;
  if (ys > -1 && xs > -1) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        cin >> a[i][j];
      }
    }
    rv = a[xs][ys];
    if (v != rv) dfs(xs, ys);
  }
  cout << k << endl;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
}