x=input("")
x=x[::-1] #列表切片，逆序輸出
print(x)

n=int(input())
for i in range(n):
x=input()
print(x)
print()
while True:
x=input().split()
for i in x:
print(i)
print()

count = 1

while True:
  a, b = map(int, input().strip().split())
  # a和b都是0則退出
  if a == 0 and b == 0:
    break
  else:
    # 輸入，把數(shù)據(jù)都存放在列表里，形成一個(gè)二維列表
    ls = []
    for i in range(a):
      ls1 = []
      n = input()
      for j in n:
        ls1.append(j)
      ls.append(ls1)
  # 對(duì)數(shù)據(jù)進(jìn)行操作，先將所有的"."換成數(shù)字0，在判斷周圍有多少個(gè)雷，有就加1,判斷周圍的雷分別有4,5,8次
  for i in range(a):
    for j in range(b):
      if ls[i][j] == '.':
        ls[i][j] = 0
      if ls[i][j] == '*':
        # 判斷左上角是否有雷
        if i - 1 >= 0 and j - 1 >= 0 and ls[i-1][j-1] != "*":
          ls[i-1][j-1] += 1
        # 判斷左邊是否有雷
        if j - 1 >= 0 and ls[i][j-1] != "*":
          ls[i][j-1] += 1
        # 判斷左下角是否有雷
        if i + 1 <= a - 1 and j - 1 >= 0 and ls[i+1][j-1] != '*':
          ls[i+1][j-1] += 1
        # 判斷上面是否有雷
        if i - 1 >= 0 and ls[i-1][j] != '*':
          ls[i-1][j] += 1
        # 判斷下面是否有雷
        if i + 1 <= a-1 and ls[i+1][j] != '*':
          ls[i+1][j] += 1
        # 判斷右上角是否有雷
        if i - 1 >= 0 and j + 1 <= b - 1 and ls[i-1][j+1] != '*':
          ls[i-1][j+1] += 1
        # 判斷右邊是否有雷
        if j + 1 <= b - 1 and ls[i][j+1] != '*':
          ls[i][j+1] += 1
        # 判斷右下角是否有雷
        if i + 1 <= a - 1 and j + 1 <= b - 1 and ls[i+1][j+1] != "*":
          ls[i+1][j+1] += 1
  # 輸出數(shù)據(jù)，并且統(tǒng)計(jì)執(zhí)行次數(shù)
  print("Field #{}:".format(count))
  for i in ls:
    for j in i:
      print(j, end='')
    print()
  print()
  count += 1