#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define all(v) v.begin(), v.end()

void solve() {
    int n, m;
    cin >> n >> m;

    vector<string> s(n * 2 - 1);
    for (int i = 0; i < n * 2 - 1; i++) cin >> s[i];

    const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
    int cnt = 0;
    vector<vector<int>> g(n * m);
    for (int i = 0; i < n; i++) {
        for (int j = i & 1; j < m; j += 2) {
            cnt += s[i * 2][j * 2] == '2' || s[i * 2][j * 2] == '4' || s[i * 2][j * 2] == '7';
            for (int k = 0; k < 4; k++) {
                int x = i + dx[k], y = j + dy[k];
                if (x < 0 || x >= n || y < 0 || y >= m) continue;
                if (s[i * 2][j * 2] == '7' && s[x * 2][y * 2] == '7') {
                    g[i * m + j].push_back(x * m + y);
                } 
            }
        }
    }
    for (int i : {0, n - 1}) {
        for (int j = i & 1; j < m; j += 2) {
            for (int k : {2, 3}) {
                int x = i + dx[k], y = j + dy[k];
                if (x < 0 || x >= n || y < 0 || y >= m) continue;
                if (s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '4'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '4') {
                    g[i * m + j].push_back(x * m + y);
                } 
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i & 1; j < m; j += 2) {
            if (j != 0 && j != m - 1) continue;
            for (int k : {0, 1}) {
                int x = i + dx[k], y = j + dy[k];
                if (x < 0 || x >= n || y < 0 || y >= m) continue;
                if (s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '4'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '4') {
                    g[i * m + j].push_back(x * m + y);
                } 
            }
        }
    }

    vector<bool> vis(n * m);
    vector<int> match(n * m, -1);
    auto dfs = [&](auto self, int u) -> bool {
        for (auto v : g[u]) {
            if (vis[v]) continue;
            vis[v] = true;
            if (match[v] == -1 || self(self, match[v])) {
                match[v] = u;
                return true;
            }
        }
        return false;
    };

    int res = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i & 1; j < m; j += 2) {
            vis.assign(n * m, false);
            res += dfs(dfs, i * m + j);
        }
    }
    if (res != cnt) {
        cout << "NO\n";
        return ;
    }

    for (int i = 0; i < n; i++) {
        for (int j = !(i & 1); j < m; j += 2) {
            if (s[i * 2][j * 2] == '2' || s[i * 2][j * 2] == '4' || s[i * 2][j * 2] == '7') {
                if (match[i * m + j] == -1) {
                    cout << "NO\n";
                    return ;
                }
            }
        }
    }


    cout << "YES\n";
    for (int i = 0; i < n * 2 - 1; i++) {
        for (int j = 0; j < m * 2 - 1; j++) {
            if (s[i][j] == '.') {
                s[i][j] = '#';
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i & 1; j < m; j += 2) {
            for (int k = 0; k < 4; k++) {
                int x = i + dx[k], y = j + dy[k];
                if (x < 0 || x >= n || y < 0 || y >= m) continue;
                if (s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '2' && s[x * 2][y * 2] == '4'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '2'
                 || s[i * 2][j * 2] == '4' && s[x * 2][y * 2] == '4'
                 || s[i * 2][j * 2] == '7' && s[x * 2][y * 2] == '7') {
                    if (match[x * m + y] == i * m + j) {
                        s[i * 2 + dx[k]][j * 2 + dy[k]] = '.';
                    }
                } 
            }
        }
    }
    for (int i = 0; i < n * 2 - 1; i++) {
        cout << s[i] << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}