from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from heapq import heappop, heappush
import math, sys
# input = sys.stdin.readline
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

H, W = map(int, input().split())
S = [list(input()) for _ in range(H)]

for i in range(H):
    for j in range(W-5):
        st = ""
        for k in range(6):
            st += S[i][j+k]
        if st == "yiwiy9":
            S[i][j+4] = "Y"
        if st == "9yiwiy":
            S[i][j+1] = "Y"

for i in range(H):
    print(*S[i],sep="")