// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 55;
const int diri[] = {1, 0, -1, 0, 1, 1, -1, -1}, 
          dirj[] = {0, 1, 0, -1, 1, -1, -1, 1};

int n, m;
string s[MAXN * 2];
bool need[MAXN][MAXN];

int getv(int i, int j) {
    int cnt = 0;
    REP (k, 0, 8) {
        int ni = i + diri[k], nj = j + dirj[k];
        if (ni < 0 || ni >= n || nj < 0 || nj >= m) {
            continue;
        }
        cnt++;
    }
    return cnt;
}

struct Edge {
    int v, f, c, rid;
};
vector<Edge> adj[MAXN * MAXN];
void addEdge(int u, int v) {
    int id = SZ(adj[u]), rid = SZ(adj[v]);
    adj[u].pb({v, 0, 1, rid});
    adj[v].pb({u, 0, 0, id});
}
int d[MAXN * MAXN];
bool bfs(int src, int sink) {
    REP (i, 0, sink + 1) {
        d[i] = INF;
    }
    d[src] = 0;
    queue<int> qu;
    qu.push(src);
    while (!qu.empty()) {
        int u = qu.front(); qu.pop();
        for (auto [v, f, c, rid] : adj[u]) {
            if (f == c) {
                continue;
            }
            if (mnto(d[v], d[u] + 1)) {
                qu.push(v);
            }
        }
    }
    return d[sink] != INF;
}
int ptr[MAXN * MAXN];
int dfs(int u, int cf, int sink) {
    if (u == sink) {
        return cf;
    }
    for (; ptr[u] < SZ(adj[u]); ptr[u]++) {
        auto &[v, f, c, rid] = adj[u][ptr[u]];
        if (f == c || d[v] != d[u] + 1) {
            continue;
        }
        int nf = dfs(v, min(cf, c - f), sink);
        if (nf) {
            f += nf;
            adj[v][rid].f -= nf;
            return nf;
        }
    }
    return 0;
}
int flow(int src, int sink) {
    int res = 0;
    while (bfs(src, sink)) {
        REP (i, 0, sink + 1) {
            ptr[i] = 0;
        }
        while (int f = dfs(src, INF, sink)) {
            res += f;
        }
    }
    return res;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, 2 * n - 1) {
        cin >> s[i];
    }
    REP (i, 0, n - 1) {
        REP (j, 0, 2 * m - 1) {
            s[i << 1 ^ 1][j] = '#';
        }
    }
    REP (i, 0, 2 * n - 1) {
        REP (j, 0, m - 1) {
            s[i][j << 1 ^ 1] = '#';
        }
    }
    REP (i, 0, n) {
        REP (j, 0, m) {
            if (s[i << 1][j << 1] - '0' != getv(i, j)) {
                assert(s[i << 1][j << 1] - '0' + 1 == getv(i, j));
                need[i][j] = 1;
            }
        }
    }
    int src = n * m, sink = src + 1;
    int tot = 0;
    auto attach = [&] (int i, int j, int k) {
        int ni = i + diri[k], nj = j + dirj[k];
        if (!need[ni][nj]) {
            return;
        }
        if (getv(i, j) == 5 && getv(ni, nj) == 8) {
            return;
        }
        if (getv(ni, nj) == 5 && getv(i, j) == 8) {
            return;
        }
        cerr << i << ' ' << j << " -> " << ni << ' ' << nj << '\n';
        addEdge(i * m + j, ni * m + nj);
    };
    REP (i, 0, n) {
        REP (j, 0, m) {
            if (!need[i][j]) {
                continue;
            }
            tot++;
            if ((i ^ j) & 1) {
                addEdge(i * m + j, sink);
            } else {
                addEdge(src, i * m + j);
            }
        }
    }
    for (int i : {0, n - 1}) {
        REP (j, 0, m) {
            if (!need[i][j]) {
                continue;
            }
            if ((i ^ j) & 1) {
                continue;
            }
            for (int k : {1, 3}) {
                attach(i, j, k);
            }
        }
    }
    REP (i, 0, n) {
        for (int j : {0, m - 1}) {
            if (!need[i][j]) {
                continue;
            }
            if ((i ^ j) & 1) {
                continue;
            }
            for (int k : {0, 2}) {
                attach(i, j, k);
            }
        }
    }
    REP (i, 1, n - 1) {
        REP (j, 1, m - 1) {
            if (!need[i][j]) {
                continue;
            }
            if ((i ^ j) & 1) {
                continue;
            }
            REP (k, 0, 4) {
                attach(i, j, k);
            }
        }
    }
    int f = flow(src, sink);
    if (tot % 2 == 1 || f != tot / 2) {
        cout << "NO\n";
        return 0;
    }
    REP (i, 0, n) {
        REP (j, 0, m) {
            if (!need[i][j]) {
                continue;
            }
            if ((i ^ j) & 1) {
                continue;
            }
            int u = i * m + j;
            for (auto [v, f, c, rid] : adj[u]) {
                if (v == src) {
                    continue;
                }
                if (f) {
                    int ni = v / m, nj = v % m;
                    if (ni == i && nj == j + 1) {
                        s[i << 1][(j << 1) + 1] = '.';
                    } else if (ni == i) {
                        assert(nj == j - 1);
                        s[i << 1][(j << 1) - 1] = '.';
                    } else if (nj == j && ni == i + 1) {
                        s[(i << 1) + 1][j << 1] = '.';
                    } else {
                        assert(nj == j && ni == i - 1);
                        s[(i << 1) - 1][j << 1] = '.';
                    }
                    break;
                }
            }
        }
    }
    cout << "YES\n";
    REP (i, 0, 2 * n - 1) {
        cout << s[i] << '\n';
    }
    return 0;
}