#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>


ll N,M;

bool valid(ll x, ll y) {
    return (0 <= x) && (x < 2*N-1) && (0 <= y) && (y < 2*M-1);
}

bool edge(ll x, ll y) {
    return (x == 0) || (x == 2*N-2) || (y == 0) || (y == 2*M-2); 
}

vector<pll> adjs(ll x, ll y) {
    vector<pll> chk = {{x+2,y},{x-2,y},{x,y+2},{x,y-2}};
    vector<pll> out = {};
    for(auto c: chk) if(valid(c.first,c.second) && (edge(x,y) == edge(c.first,c.second))) out.push_back(c);
    return out;
}

bool small(char x) {
    return x == '2' || x == '4' || x == '7';
}

int main() {
     cin >> N >> M;

    vector<string> grid(2*N-1);
    for(ll i = 0; i < 2*N-1; i++) { cin >> grid[i]; for(auto& x: grid[i]) if(x == '.') x='#';}

    vector<vector<bool>> matched(2*N-1, vector<bool>(2*M-1,false));

    while(true) {
        pll mxy;
        ll nxya = 100;
        for(ll i = 0; i < grid.size(); i += 2) {
            for(ll j = 0; j < grid.size(); j += 2) {
                if(matched[i][j]) continue;
                if(!small(grid[i][j])) continue;

                ll na = 0;
                for(auto a: adjs(i,j)) if(small(grid[a.first][a.second]) && !matched[a.first][a.second]) na++;

                if(na < nxya) {
                    mxy = {i,j};
                    nxya = na;
                }
            }
        }
        if(nxya == 100) break;

        if(nxya == 0) {
            cout << "NO\n"; return 0;
        }

        for(auto a: adjs(mxy.first,mxy.second)) {
            if(small(grid[a.first][a.second]) && !matched[a.first][a.second]) {
                matched[mxy.first][mxy.second]=true;
                matched[a.first][a.second]=true;
                grid[(mxy.first+a.first)/2][(mxy.second+a.second)/2]='.';
                break;
            }
        }
    }

    for(auto x: grid) cout << x << endl;
    




}