#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    vector<string>s(2 * n);
    for (auto &i : s) cin >> i;

    priority_queue<tuple<int, int, int>>q;
    for (int i = 0; i < 2 * n - 1; i++) {
        for (int j = 0; j < 2 * m - 1; j++) {
            if(s[i][j] == '2' || s[i][j] == '4' || s[i][j] == '7')
                q.push({-(s[i][j] - '0'), i, j});
            if(s[i][j] == '.') s[i][j] = '#'; 
        } 
    }
    vector st(2 * n + 1, vector<int>(2 * m + 1));
    auto dfs = [&](auto &&dfs) -> void {
        int lzy, x, y;
        queue<tuple<int, int, int>>popout;
        while(q.size()) {
            tie(lzy, x, y) = q.top();
            popout.push({lzy, x, y});
            q.pop();
            if(st[x][y]) continue;
            else break;
        }
        if(!q.size()) {
            cout << "YES\n";
            for (int i = 0; i < 2 * n - 1; i++) {
                for (int j = 0; j < 2 * m - 1; j++) 
                    cout << s[i][j];
                cout << '\n';
            }
            exit(0);
        } 
        // cout << lzy << ' ' << x << ' ' << y << '\n';

        for (int i = -1; i <= 1; i++) {
            for (int j = -1; j <= 1; j++) {
                int nx = x + i, ny = y + j;
                if(nx < 0 || nx >= 2 * n - 1 || ny < 0 || ny >= 2 * m - 1) continue;
                if(s[nx][ny] != '#') continue;
                if((s[x][y] == '2' || s[x][y] == '4') && (nx != 0 && nx != 2 * n - 2 && ny != 0 && ny != 2 * m - 2)) continue;
    
                // cout << nx << ' ' << ny << '\n';
                int flag = 1;
                for (int dx = -1; dx <= 1 && flag; dx++) {
                    for (int dy = -1; dy <= 1 && flag; dy++) {
                        int nx1 = nx + dx, ny1 = ny + dy;
                        if(nx1 < 0 || nx1 >= 2 * n - 1 || ny1 < 0 || ny1 >= 2 * m - 1) continue;
                        if(s[nx1][ny1] == '.' || s[nx1][ny1] == '#') continue;
                        if(s[nx1][ny1] == '3' || s[nx1][ny1] == '8' || s[nx1][ny1] == '5')
                            flag = 0;
                        else if(st[nx1][ny1]) flag = 0;
                    }
                }
                if(!flag) continue;

                for (int dx = -1; dx <= 1 && flag; dx++) {
                    for (int dy = -1; dy <= 1 && flag; dy++) {
                        int nx1 = nx + dx, ny1 = ny + dy;
                        if(nx1 < 0 || nx1 >= 2 * n - 1 || ny1 < 0 || ny1 >= 2 * m - 1) continue;
                        if(s[nx1][ny1] == '.' || s[nx1][ny1] == '#') continue;
                        st[nx1][ny1]++;
                    }
                }
                s[nx][ny] = '.';
                dfs(dfs);
                for (int dx = -1; dx <= 1 && flag; dx++) {
                    for (int dy = -1; dy <= 1 && flag; dy++) {
                        int nx1 = nx + dx, ny1 = ny + dy;
                        if(nx1 < 0 || nx1 >= 2 * n - 1 || ny1 < 0 || ny1 >= 2 * m - 1) continue;
                        if(s[nx1][ny1] == '.' || s[nx1][ny1] == '#') continue;
                        st[nx1][ny1]--;
                    }
                }
                s[nx][ny] = '#';
            }
        }
        while(popout.size()) { 
            q.push(popout.front());
            popout.pop();
        }
    };

    dfs(dfs);
    cout << "NO\n";

    return 0;
}