251001

# 자료구조
# 스택, 큐, 정렬, 그래프(dfs/bfs)

#
# stack=[]
#
# stack.append(10)          # push
# stack.pop()             # pop
# len(stack)              # size
# if len(stack)==0 :       # empty?
#     print("stack is empty")
#
#
# queue = []
#
#
# queue.append(10)            #뒤로넣고
# queue.pop(0)                #앞으로빼는
#
# queue.insert(0,10)          # 앞으로넣고
# queue.pop(-1)                               # 뒤로빼고
#
#
# # 정렬
# queue.sort()
#
# # python에서 int 범위가 무한대
#
# a = 123486724567867435453
# b = str(a)
#
# print(b[0:3])
#
#
# b+="7"
# c=int(b)
# print(b)
#


'''
그래프

DFS 4697, 2610
BFS 1512, 3600
'''

def dfs(k, p):
    global arr
    if k<0 or p<0 or k>11 or p>11 or arr[k][p]=='*':
        return
    else:
        arr[k][p]='*'
        dfs(k+1, p)
        dfs(k, p+1)
        dfs(k-1, p)
        dfs(k, p-1)

arr=[]
for i in range(10):
    b=list(map(str,input().split()))
    arr.append(b)
x, y=map(int,input().split())
dfs(x, y)
for i in range(10):
    for j in range(10):
        print(arr[i][j])

    print()