#include <bits/stdc++.h>
using namespace std;
const int maxn=1005;
const int a[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int read(){
	int ret=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
	while( isdigit(ch)){ret=(ret<<3)+(ret<<1)+(ch&15);ch=getchar();}
	return ret*f;
}
int n,m,x,y,c;
char ch[maxn][maxn];
bool vis[maxn][maxn];
struct node{
	int x,y;	
}que[maxn*maxn];
bool check(int x,int y){
	return 1<=x&&x<=n&&1<=y&&y<=m&&!vis[x][y];
}
void BFS(){
	int hed=0,til=0;
	char p=ch[x][y];
	que[++til]=(node){x,y};
	vis[x][y]=1;
	ch[x][y]=c+'0';
	while(hed<til){
		node now=que[++hed];
		for(int i=0;i< 4;++i){
			if(check(now.x+a[i][0],now.y+a[i][1])&&ch[now.x+a[i][0]][now.y+a[i][1]]==p){
				que[++til]=(node){now.x+a[i][0],now.y+a[i][1]};
				vis[now.x+a[i][0]][now.y+a[i][1]]=1;
				ch[now.x+a[i][0]][now.y+a[i][1]]=c+'0';
			}
		}
	}
}
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			ch[i][j]=getchar();
			while(!isdigit(ch[i][j])) ch[i][j]=getchar(); 
		}
	}
	x=read()+1,y=read()+1;
	c=read();
	BFS();
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			putchar(ch[i][j]);
		}
		putchar('\n');
	}	
	return 0;
}