#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = (int)1e9 + 1001010;
const ll llINF = (long long)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {
    return vector(i, vector<T>(j, init));
}
const string ELM_SEP = " ", VEC_SEP = endn;
template <class T> istream &operator>>(istream &i, vector<T> &A) {
    for(auto &I : A) i >> I;
    return i;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &A) {
    int sz = A.size();
    for(const auto &I : A) o << I << (--sz ? ELM_SEP : "");
    return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<vector<T>> &A) {
    int sz = A.size();
    for(const auto &I : A) o << I << (--sz ? VEC_SEP : "");
    return o;
}
template <class T> vector<T> &operator++(vector<T> &A, int) {
    for(auto &I : A) I++;
    return A;
}
template <class T> vector<T> &operator--(vector<T> &A, int) {
    for(auto &I : A) I--;
    return A;
}
template <class T, class U> bool chmax(T &a, const U &b) { return ((a < b) ? (a = b, true) : false); }
template <class T, class U> bool chmin(T &a, const U &b) { return ((a > b) ? (a = b, true) : false); }
ll floor_div(ll a, ll b) {
    if(b < 0) a = -a, b = -b;
    return (a >= 0) ? a / b : (a + 1) / b - 1;
}
ll ceil_div(ll a, ll b) {
    if(b < 0) a = -a, b = -b;
    return (a > 0) ? (a - 1) / b + 1 : a / b;
}
bool check_bit(ull val, ull digit) { return (val >> digit) & 1; }
#ifdef DEBUG
#include <cpp-dump/cpp-dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
struct InitCppDump {
    InitCppDump() {
        if(!isatty(fileno(stderr))) CPP_DUMP_SET_OPTION(es_style, cpp_dump::types::es_style_t::no_es);
        CPP_DUMP_SET_OPTION(log_label_func, cp::log_label::line());
        CPP_DUMP_SET_OPTION(max_iteration_count, 30);
    }
} init_cpp_dump;
#else
#define dump(...)
#endif
// ==================== ここまでテンプレ ====================

template <typename Iterator> vector<int> z_algorithm(const Iterator begin, const Iterator end) {
    int n = end - begin;
    assert(n >= 0);
    vector<int> ret(n, 0);
    ret[0] = n;

    for(int i = 1, j = 0; i < n;) {
        while(i + j < n && begin[i + j] == begin[j]) j++;
        ret[i] = j;
        if(j == 0) {
            i++;
            continue;
        }

        int k = 1;
        while(i + k < n && k + ret[k] < ret[i]) ret[i + k] = ret[k], k++;
        i += k;
        j -= k;
    }
    return ret;
}

vector<int> z_algorithm(const string &s) { return z_algorithm(s.begin(), s.end()); }

template <class T> vector<int> z_algorithm(const vector<T> &v) { return z_algorithm(v.begin(), v.end()); }

namespace slephy {
// O(max(|s|, |ret|))
[[nodiscard]] string replace(const string &s, const string &from, const string &to) {
    if(from.empty()) return s;
    vector<int> z;
    {
        string tmp = from + char(128) + s;
        z = move(z_algorithm(tmp));
    }

    string ret;
    int n = (int)s.size(), m = (int)from.size();
    for(int i = 0; i < n;) {
        if(z[i + m + 1] >= m) {
            ret += to;
            i += m;
        }
        else {
            ret += s[i];
            i++;
        }
    }
    return ret;
}
};  // namespace slephy

int main(int argc, char *argv[]) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll h, w;
    cin >> h >> w;
    vector<string> s(h);
    cin >> s;

    for(auto &si : s) {
        si = slephy::replace(si, "yiwiy9", "yiwiY9");
        si = slephy::replace(si, "9yiwiy", "9Yiwiy");
        cout << si << endl;
    }
    return 0;
}