#include using namespace std; #define ll long long #define ull unsigned long long #define ld long double using LL = long long; using ULL = unsigned long long; using VI = vector; using VVI = vector; using VVVI = vector; using VL = vector; using VVL = vector; using VVVL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VC = vector; using VS = vector; using VVC = vector; using PII = pair; using PLL = pair; using PDD = pair; using PIL = pair; using MII = map; using MLL = map; using SI = set; using SL = set; using MSI = multiset; using MSL = multiset; template using MAXPQ = priority_queue; template using MINPQ = priority_queue< T, vector, greater >; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; #define PI 3.14159265358979323846 #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EACH(e, v) for(auto &e : v) #define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it) #define ALL(v) v.begin(),v.end() vector x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1}; int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1}; /* memo -uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy -isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10 -dijkstra,Floyd,bellmanford,sccd,topological,treediamiter -compress1,compress2,rotate90 -co,ci,fo1,fo2,fo3,fo4 -bitsearch,binaryserach -bfs -SegTreedec,SegTreeLazydec */ int main(){ cin.tie(0); ios_base::sync_with_stdio(0); ll H,W; cin >> H >> W; VS s(H); for(ll i = 0; i < H; i++) cin >> s[i]; auto getstr = [&](ll x, ll y){ string res = ""; for(ll i = 0; i < 6; i++){ if(y+i < W)res += s[x][y+i]; } return res; }; VVL raise(H,VL(W,0)); for(ll i = 0; i < H; i++){ for(ll j = 0; j < W; j++){ if(j < W and !raise[i][j]){ string str = getstr(i,j); if(str=="yiwiy9"){ s[i][j+4] = 'Y'; for(ll k = 0; k < 6; k++){ raise[i][j+k] = 1; } } else if(str=="9yiwiy"){ s[i][j+1] = 'Y'; for(ll k = 0; k < 6; k++){ raise[i][j+k] = 1; } } } } } for(ll i = 0; i < H; i++) cout << s[i] << '\n'; }