import sys, time, random, heapq, math, itertools, copy
from collections import deque, Counter, defaultdict
from bisect import bisect, bisect_left, bisect_right
import heapq as hq
from functools import cache, cmp_to_key
def debug(*x):print('debug:',*x, file=sys.stderr)
sys.setrecursionlimit(300000)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353
dir = [(0, 1), (0, -1), (1, 0), (-1, 0)]

H, W = mi()
S = [list(input()) for _ in range(H)]
for i in range(H):
    for j in range(len(S[i])):
        
        if S[i][j] == "y" :
            flg = False
            if j < len(S[i]) - 1 and S[i][j + 1] == "9":
                flg = True
            if j > 0 and S[i][j - 1] == "9":
                flg = True
            if flg:
                S[i][j] = "Y"
for i in range(H):
    print("".join(S[i]))