#include <iostream>
#include <vector>

using namespace std;

const int MAXN = 1000;

int R, C, Y, X, K;
int grid[MAXN][MAXN];
bool visited[MAXN][MAXN];

// Check if a given position is within bounds and has the same color as the target
bool isValid(int r, int c, int target) {
    return r >= 0 && r < R && c >= 0 && c < C && grid[r][c] == target && !visited[r][c];
}

// Recursive function to fill all connected pixels of the same color with the target color
void fill(int r, int c, int target) {
    visited[r][c] = true;
    grid[r][c] = K;

    if (isValid(r+1, c, target)) fill(r+1, c, target);
    if (isValid(r-1, c, target)) fill(r-1, c, target);
    if (isValid(r, c+1, target)) fill(r, c+1, target);
    if (isValid(r, c-1, target)) fill(r, c-1, target);
}

int main() {
    cin >> R >> C;

    for (int r = 0; r < R; r++) {
        for (int c = 0; c < C; c++) {
            cin >> grid[r][c];
        }
    }

    cin >> Y >> X >> K;
    fill(Y, X, grid[Y][X]);

    for (int r = 0; r < R; r++) {
        for (int c = 0; c < C; c++) {
            cout << grid[r][c];
        }
        cout << endl;
    }

    return 0;
}