#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }


void solve() {
    ll H,W;
    cin>>H>>W;
    vector<string> S(H);
    rep(i,H)cin>>S[i];
    rep(i,H){
        rep(j,W){
            if (j<W-1 and S[i][j]=='y' and S[i][j+1]=='9'){
                S[i][j]='Y';
                j+=2;
                continue;
            }
            if (j>0 and S[i][j]=='y' and S[i][j-1]=='9'){
                S[i][j]='Y';
                j+=4;
                continue;
            }
        }
    }
    rep(i,H){
        cout<<S[i]<<endl;
    }
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}