#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int fg[55][55];
int n,x1,y1;
void dfs(int x,int y){
	if(fg[x][y]!=0)return;
	fg[x][y]=2;
	
	dfs(x-1,y);
	dfs(x,y+1);
	dfs(x+1,y);
	dfs(x,y-1);
}
int main(){
	cin>>n>>x1>>y1;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cin>>fg[i][j];
		}
	}
	x1--;y1--;
	dfs(x1,y1);
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cout<<fg[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}