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

const vector<pll> deltas = {{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};

array<array<ll, 101>, 101> state = {};

array<array<ll, 101>, 101> setby = {};

int N, M;

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

void print(vector<string>& grid) {
    for(ll i = 0; i < 2*N-1; i++) {
        for(ll j = 0; j < 2*M-1; j++) {
            if(grid[i][j] != '.') cout << grid[i][j];
            else if(state[i][j] == 1) cout << '#';
            else cout << '.';
        }
        cout << "\n";
    }
}


bool dfs(ll x, ll y, ll depth, vector<string>& grid) {
    if(x > grid.size()) return true;

    ll nh = grid[x][y] - '0';

    /*cout << x << " " << y << "\n";
    print(grid);
    cout << "\n\n\n";*/

    for(ll start = 0; start < 8; start++) {

        bool valid = true;

        for(ll d = 0; d < 8; d++) {
            auto dxy = deltas[(start+d)%8];
            ll x2 = x + dxy.first;
            ll y2 = y + dxy.second;

            ll desired = 1;
            if(d >= nh) desired = 2;

            if(oob(x2,y2)) {
                if(desired == 1) valid = false;
                continue;
            }

            if(setby[x2][y2] == 0) {
                setby[x2][y2] = depth;
                state[x2][y2] = desired;
            } else {
                valid = valid && (state[x2][y2] == desired);
            }
        }

        ll nx = x, ny = y+2;
        if(ny > grid[0].size()) {
            ny = 0;
            nx = x+2;
        }
        
        //cout << "recur " << start << "\n";
        if(valid && dfs(nx,ny,depth+1,grid)) return true;

        for(ll d = 0; d < 8; d++) {
            auto dxy = deltas[(start+d)%8];
            ll x2 = x + dxy.first;
            ll y2 = y + dxy.second;
            if(oob(x2,y2)) continue;
            if(setby[x2][y2] == depth) {
                setby[x2][y2] = 0;
                state[x2][y2] = 0;
            } 
        }
    }

    return false;

}

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

    vector<string> grid(2*N-1);
    for(ll i = 0; i < 2*N-1; i++) cin >> grid[i];

    bool good = dfs(0,0,1,grid);

    if(good) {
        cout << "YES\n"; print(grid);
    } else {
        cout << "NO\n";
    }
    




}