Two bears are playing tic-tac-toe via mail. It's boring for them to play usual tic-tac-toe game, so they are a playing modified version of this game. Here are its rules.

The game is played on the following field.

Players are making moves by turns. At first move a player can put his chip in any cell of any small field. For following moves, there are some restrictions: if during last move the opposite player put his chip to cell with coordinates (*x*<sub class="lower-index">*l*</sub>, *y*<sub class="lower-index">*l*</sub>) in some small field, the next move should be done in one of the cells of the small field with coordinates (*x*<sub class="lower-index">*l*</sub>, *y*<sub class="lower-index">*l*</sub>). For example, if in the first move a player puts his chip to lower left cell of central field, then the second player on his next move should put his chip into some cell of lower left field (pay attention to the first test case). If there are no free cells in the required field, the player can put his chip to any empty cell on any field.

You are given current state of the game and coordinates of cell in which the last move was done. You should find all cells in which the current player can put his chip.

A hare works as a postman in the forest, he likes to foul bears. Sometimes he changes the game field a bit, so the current state of the game could be unreachable. However, after his changes the cell where the last move was done is not empty. You don't need to find if the state is unreachable or not, just output possible next moves according to the rules.
First 11 lines contains descriptions of table with 9 rows and 9 columns which are divided into 9 small fields by spaces and empty lines. Each small field is described by 9 characters without spaces and empty lines. character "x" (ASCII-code 120) means that the cell is occupied with chip of the first player, character "o" (ASCII-code 111) denotes a field occupied with chip of the second player, character "." (ASCII-code 46) describes empty cell.

The line after the table contains two integers *x* and *y* (1 ≤ *x*, *y* ≤ 9). They describe coordinates of the cell in table where the last move was done. Rows in the table are numbered from up to down and columns are numbered from left to right.

It's guaranteed that cell where the last move was done is filled with "x" or "o". Also, it's guaranteed that there is at least one empty cell. It's not guaranteed that current state of game is reachable.
In the first test case the first player made a move to lower left cell of central field, so the second player can put a chip only to cells of lower left field.

In the second test case the last move was done to upper left cell of lower central field, however all cells in upper left field are occupied, so the second player can put his chip to any empty cell.

In the third test case the last move was done to central cell of central field, so current player can put his chip to any cell of central field, which is already occupied, so he can move anywhere. Pay attention that this state of the game is unreachable.
... ... ...
... ... ...
... ... ...

... ... ...
... ... ...
... x.. ...

... ... ...
... ... ...
... ... ...
6 4
... ... ... 
... ... ... 
... ... ... 

... ... ... 
... ... ... 
... x.. ... 

!!! ... ... 
!!! ... ... 
!!! ... ... 
xoo x.. x..
ooo ... ...
ooo ... ...

x.. x.. x..
... ... ...
... ... ...

x.. x.. x..
... ... ...
... ... ...
7 4
xoo x!! x!! 
ooo !!! !!! 
ooo !!! !!! 

x!! x!! x!! 
!!! !!! !!! 
!!! !!! !!! 

x!! x!! x!! 
!!! !!! !!! 
!!! !!! !!! 
o.. ... ...
... ... ...
... ... ...

... xxx ...
... xox ...
... ooo ...

... ... ...
... ... ...
... ... ...
5 5
o!! !!! !!! 
!!! !!! !!! 
!!! !!! !!! 

!!! xxx !!! 
!!! xox !!! 
!!! ooo !!! 

!!! !!! !!! 
!!! !!! !!! 
!!! !!! !!! 
.o. .o. ..x
..x .xx ..o
... ... ...

... ... xxo
..x o.o oxo
.x. .o. xoo

... o.. ...
..o .xx ..x
... ... ...
5 9
!o! !o! !!x 
!!x !xx !!o 
!!! !!! !!! 

!!! !!! xxo 
!!x o!o oxo 
!x! !o! xoo 

!!! o!! !!! 
!!o !xx !!x 
!!! !!! !!! 
... .o. ...
... ... ...
... ... ...

... ... ...
... ... ...
... .x. ..x

.x. ... ...
..o ... .o.
... o.o xx.
1 5
... !o! ... 
... !!! ... 
... !!! ... 

... ... ... 
... ... ... 
... .x. ..x 

.x. ... ... 
..o ... .o. 
... o.o xx. 
ooo oxx xxo
x.x oox xox
oox xo. xxx

xxo xxx o.o
xoo xo. oxo
ooo xox ox.

xoo xoo .oo
xox xox ox.
oxx xox oxo
1 3
ooo oxx xxo 
x!x oox xox 
oox xo! xxx 

xxo xxx o!o 
xoo xo! oxo 
ooo xox ox! 

xoo xoo !oo 
xox xox ox! 
oxx xox oxo 
... ... ...
..o ... ..o
... .x. ..x

x.. ... ...
.x. .ox oo.
... .xo ..x

... ... .ox
... ox. ..x
... ..o .o.
2 3
... ... ... 
..o ... ..o 
... .x. ..x 

x.. ... !!! 
.x. .ox oo! 
... .xo !!x 

... ... .ox 
... ox. ..x 
... ..o .o. 
xox o.x xxo
xox xox oxo
xxx .xx xoo

ooo oox o.x
.xx xx. oo.
ooo xox ooo

ooo oxo xox
x.x xox xox
oxo x.o xxo
1 7
xox o!x xxo 
xox xox oxo 
xxx !xx xoo 

ooo oox o!x 
!xx xx! oo! 
ooo xox ooo 

ooo oxo xox 
x!x xox xox 
oxo x!o xxo 
ox. x.o ..x
... ..o .o.
.o. ... x.o

x.x .oo ...
..o ox. .xx
..x o.x .o.

... ... .x.
ox. xx. .o.
... ... ..o
9 9
ox. x.o ..x 
... ..o .o. 
.o. ... x.o 

x.x .oo ... 
..o ox. .xx 
..x o.x .o. 

... ... !x! 
ox. xx. !o! 
... ... !!o 
xx. oxx .xo
xxx o.o xox
xoo xoo xoo

ooo o.x xox
o.. xoo .xo
oxx .x. xoo

ooo oxo oxx
xxx xox ..o
oo. oxx xx.
3 8
xx! oxx !xo 
xxx o!o xox 
xoo xoo xoo 

ooo o!x xox 
o!! xoo !xo 
oxx !x! xoo 

ooo oxo oxx 
xxx xox !!o 
oo! oxx xx! 
... xo. o..
oo. ..o xx.
..x x.. ..o

.ox .xx ...
o.x xox xo.
xox .xo ..o

..o ... xxo
o.. .o. oxo
..o x.. ..x
8 9
... xo. o.. 
oo. ..o xx. 
..x x.. ..o 

.ox .xx !!! 
o.x xox xo! 
xox .xo !!o 

..o ... xxo 
o.. .o. oxo 
..o x.. ..x 
oox xoo xxx
ooo xxo oxo
xxx xoo xxo

oxo oxx xoo
xoo oox xox
xox oox oox

xxo xoo oxo
oxx xxx xxx
oxo oxo oo.
1 5
oox xoo xxx 
ooo xxo oxo 
xxx xoo xxo 

oxo oxx xoo 
xoo oox xox 
xox oox oox 

xxo xoo oxo 
oxx xxx xxx 
oxo oxo oo! 
.oo x.o xoo
.o. xxx .x.
..o x.o xxx

..o .oo .xx
.x. xox o.o
.xo o.o .x.

.o. xo. xxx
.xo o.. .xo
..o ..o xox
1 8
.oo x!o xoo 
.o. xxx .x. 
..o x!o xxx 

..o .oo .xx 
.x. xox o.o 
.xo o.o .x. 

.o. xo. xxx 
.xo o.. .xo 
..o ..o xox 
xxo xoo xxo
ooo ooo xxx
oox oxo oxx

oxo oxo xxx
xoo oxx oxo
xxx oxx ooo

oxx xoo xxo
xxx oox xox
xxo o.o oxo
9 6
xxo xoo xxo 
ooo ooo xxx 
oox oxo oxx 

oxo oxo xxx 
xoo oxx oxo 
xxx oxx ooo 

oxx xoo xxo 
xxx oox xox 
xxo o!o oxo 
ox. o.x .o.
xxo xoo .oo
.xx oox o..

xx. oox oxx
oox oxx xxo
xo. oxo x.x

o.x .x. xx.
.xo ox. ooo
.ox xo. ..o
6 2
ox. o.x .o. 
xxo xoo .oo 
.xx oox o.. 

xx. oox oxx 
oox oxx xxo 
xo. oxo x.x 

o.x !x! xx. 
.xo ox! ooo 
.ox xo! ..o 
oxo xoo ox.
xxx xoo xxo
xoo xxx xox

xxx xxx xoo
ooo o.o oxx
xxo ooo xxx

ooo oox ooo
ooo oxo xxx
xxo xox xxo
6 1
oxo xoo ox! 
xxx xoo xxo 
xoo xxx xox 

xxx xxx xoo 
ooo o!o oxx 
xxo ooo xxx 

ooo oox ooo 
ooo oxo xxx 
xxo xox xxo 
.xo oxx xoo
ooo .xo xxx
oxo oox xoo

x.o xoo xxx
xo. oxo oxx
x.x xoo o.o

xoo xox oxx
ooo .x. .xx
xox x.. xoo
6 5
.xo oxx xoo 
ooo .xo xxx 
oxo oox xoo 

x.o xoo xxx 
xo. oxo oxx 
x.x xoo o.o 

xoo xox oxx 
ooo !x! .xx 
xox x!! xoo 
oxo xox ooo
.xo xxo oxx
xxx oxo xxx

xxo oxx .xx
xo. xoo oxx
oxo oxx xox

xoo ooo oox
ooo ooo xxo
xxx x.o oxo
2 2
oxo xox ooo 
!xo xxo oxx 
xxx oxo xxx 

xxo oxx !xx 
xo! xoo oxx 
oxo oxx xox 

xoo ooo oox 
ooo ooo xxo 
xxx x!o oxo 
xox xxx xoo
xoo xxx oxo
xoo oox xoo

oxo oox xox
oxo xox xox
oox xoo oox

o.o xox oox
oox xxo xxo
xox xxx oxo
3 4
xox xxx xoo 
xoo xxx oxo 
xoo oox xoo 

oxo oox xox 
oxo xox xox 
oox xoo oox 

o!o xox oox 
oox xxo xxo 
xox xxx oxo 
ooo xxx .x.
xxo oox ooo
.o. oox xxx

xox oxx xxo
xxx oxx oxx
oxx ooo ooo

.oo xoo xo.
xxo oox ooo
xox xxx xxo
5 1
ooo xxx !x! 
xxo oox ooo 
!o! oox xxx 

xox oxx xxo 
xxx oxx oxx 
oxx ooo ooo 

!oo xoo xo! 
xxo oox ooo 
xox xxx xxo 
def color(x1, y1, x2, y2):
	k = 0
	for i in range(x1, x2):
		for j in range(y1, min(len(field[i]), y2 + 1)):
			if field[i][j] == '.':
				field[i][j] = '!'
				k += 1
	return k != 0

field = [list(input()) for i in range(11)]
x, y = map(int, input().split())
xg = x % 3 + 3 * (x % 3 == 0)
yg = y % 3 + 3 * (y % 3 == 0)
x2 = 4 * xg - 1
y2 = 4 * yg - 1
x1 = x2 - 3
y1 = y2 - 3
if not(color(x1, y1, x2, y2)):
	color(0, 0, 11, 10)
for i in range(len(field)):
	for j in range(len(field[i])):
		print(field[i][j], end = '')
	print()