Problem: 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.

<image>

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 (xl, yl) in some small field, the next move should be done in one of the cells of the small field with coordinates (xl, yl). 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.

Input

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.

Output

Output the field in same format with characters "!" (ASCII-code 33) on positions where the current player can put his chip. All other cells should not be modified.

Examples

Input

... ... ...
... ... ...
... ... ...

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

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


Output

... ... ... 
... ... ... 
... ... ... 

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

!!! ... ... 
!!! ... ... 
!!! ... ... 



Input

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

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

x.. x.. x..
... ... ...
... ... ...
7 4


Output

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

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

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



Input

o.. ... ...
... ... ...
... ... ...

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

... ... ...
... ... ...
... ... ...
5 5


Output

o!! !!! !!! 
!!! !!! !!! 
!!! !!! !!! 

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

!!! !!! !!! 
!!! !!! !!! 
!!! !!! !!! 

Note

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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 100 + 10;
string s, t;
string maps[maxn];
map<pair<int, int>, int> mp;
void init() {
  mp.clear();
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 9; j++) {
      if (j == 1 || j == 2 || j == 3)
        mp[pair<int, int>(i, j)] = 1;
      else if (j == 4 || j == 5 || j == 6)
        mp[pair<int, int>(i, j)] = 2;
      else
        mp[pair<int, int>(i, j)] = 3;
    }
  }
  for (int i = 4; i <= 6; i++) {
    for (int j = 1; j <= 9; j++) {
      if (j == 1 || j == 2 || j == 3)
        mp[pair<int, int>(i, j)] = 4;
      else if (j == 4 || j == 5 || j == 6)
        mp[pair<int, int>(i, j)] = 5;
      else
        mp[pair<int, int>(i, j)] = 6;
    }
  }
  for (int i = 7; i <= 9; i++) {
    for (int j = 1; j <= 9; j++) {
      if (j == 1 || j == 2 || j == 3)
        mp[pair<int, int>(i, j)] = 7;
      else if (j == 4 || j == 5 || j == 6)
        mp[pair<int, int>(i, j)] = 8;
      else
        mp[pair<int, int>(i, j)] = 9;
    }
  }
}
int judge(int x, int y) {
  while (x > 3) x -= 3;
  while (y > 3) y -= 3;
  return (x - 1) * 3 + y;
}
int main(int argc, char const *argv[]) {
  int num = 1;
  init();
  for (int i = 0; i < 11; i++) {
    getline(cin, s);
    t = "";
    t.push_back(' ');
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == ' ') continue;
      t.push_back(s[j]);
    }
    if (i == 7 || i == 3) continue;
    maps[num++] = t;
  }
  int x, y;
  cin >> x >> y;
  num = judge(x, y);
  bool flag = false;
  for (int i = 1; i <= 9; i++) {
    for (int j = 1; j <= 9; j++) {
      if (mp[pair<int, int>(i, j)] == num && maps[i][j] == '.') {
        flag = true;
        maps[i][j] = '!';
      }
    }
  }
  if (!flag) {
    for (int i = 1; i <= 9; i++) {
      for (int j = 1; j <= 9; j++) {
        if (maps[i][j] == '.') maps[i][j] = '!';
      }
    }
  }
  for (int i = 1; i <= 9; i++) {
    if (i == 4 || i == 7) printf("\n");
    for (int j = 1; j <= 9; j++) {
      if (j == 4 || j == 7)
        printf(" %c", maps[i][j]);
      else
        printf("%c", maps[i][j]);
    }
    printf("\n");
  }
  return 0;
}