#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <chrono>
#include <random>
#include <string>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <bitset>
#include <array>
#include <stack>
#include <sstream>
using namespace std;
typedef long long ll;
 
string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}
 
#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("usr/share/man/man1/input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

// do something, stay focused
// look for stupid bugs
// guess, slow, stress
// don't overgeneralize
// don't rush

// don't waste time on standings

// SOLVE THE PROBLEM OR DIE TRYING
// THE SOLUTION IS ALWAYS SIMPLE
// THE CODE IS ALWAYS SHORT

const int K = 105;
const int N = K * K + 5;

vector<int> g[N];
int lef[N];
int rig[N];
bitset<N> used;

bool dfs(int v) {
    used[v] = 1;
    for (int u : g[v]) {
        if (lef[u] != v) {
            bool ok;
            if (!lef[u]) ok = 1;
            else if (!used[lef[u]]) {
                ok = dfs(lef[u]);
            }
            else ok = 0;
            if (ok) {
                rig[v] = u;
                lef[u] = v;
                return 1;
            }
        }
    }
    return 0;
}

int kuhn(int n) {
    int res = 0;
    for (int i = 1; i <= n; i++) {
        used.reset();
        res += dfs(i);
    }
    return res;
}

int dx[] = {2, -2, 0, 0};
int dy[] = {0, 0, 2, -2};
char a[K][K];
bool b[K][K];
int n, m;

bool is_val(int i, int j) {
    return 1 <= i && i <= n && 1 <= j && j <= m;
}

bool is_cor(int i, int j) {
    return (i == 1 || i == n) && (j == 1 || j == m);
}

bool is_bou(int i, int j) {
    return (i == 1 || i == n || j == 1 || j == m) && !is_cor(i, j);
}

bool is_in(int i, int j) {
    return !is_cor(i, j) && !is_bou(i, j);
}

int cnt(int i, int j) {
    if (is_cor(i, j)) {
        return 3;
    }
    if (is_bou(i, j)) {
        return 5;
    }
    return 8;
}

vector<pair<int, int>> neighs(int i, int j) {
    vector<pair<int, int>> res;
    for (int k = 0; k < 4; k++) {
        int x = i + dx[k];
        int y = j + dy[k];
        if (is_val(x, y)) {
            if (is_bou(i, j)) {
                if (is_cor(x, y)) {
                    res.push_back({x, y});
                }
                else if (is_bou(x, y)) {
                    bool ok = 0;
                    if (i == x && (i == 1 || i == n)) {
                        ok = 1;
                    }
                    if (j == y && (j == 1 || j == m)) {
                        ok = 1;
                    }
                    if (ok) {
                        res.push_back({x, y});
                    }
                }
            }
            else {
                if (is_in(i, j)) {
                    if (!is_bou(x, y)) {
                        res.push_back({x, y});
                    }
                }
                else {
                    res.push_back({x, y});
                }
            }
        }
    }
    return res;
}

int Map(int i, int j) {
    return (i - 1) * m + j;
}

pair<int, int> Inv(int x) {
    int j = x % m;
    if (j == 0) {
        j = m;
    }
    int i = (x - j) / m + 1;
    return {i, j};
}

void add_e(int u, int v) {
    g[u].push_back(v);
}

void Solve() {
    cin >> n >> m;
    n = 2 * n - 1;
    m = 2 * m - 1;
    int tar = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            if ((i & 1) && (j & 1)) {
                int cur = a[i][j] - '0';
                if (cur < cnt(i, j)) {
                    b[i][j] = 1;
                    tar++;
                }
            }
            else {
                a[i][j] = '#';
            }
        }
    }
    if (tar & 1) {
        cout << "NO\n";
        return;
    }
    tar /= 2;
    for (int i = 1; i <= n; i += 2) {
        for (int j = 1; j <= m; j += 2) {
            if ((i % 4) != (j % 4)) continue;
            if (!b[i][j]) continue;
            for (auto [x, y] : neighs(i, j)) {
                if (!b[x][y]) continue;
                add_e(Map(i, j), Map(x, y));
            }
        }
    }
    int mat = kuhn(n * m);
    if (mat != tar) {
        cout << "NO\n";
        return;
    }
    for (int i = 1; i <= n; i += 2) {
        for (int j = 1; j <= m; j += 2) {
            if ((i % 4) != (j % 4)) continue;
            if (!b[i][j]) continue;
            int v = Map(i, j);
            auto [x, y] = Inv(rig[v]);
            int mx = (i + x) / 2;
            int my = (j + y) / 2;
            a[mx][my] = '.';
        }
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cout << a[i][j];
        }
        cout << "\n";
    }
}