#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005;

int n,m;
int get_id(int x,int y){
    return (x - 1) * m + y;
}

int num[505][505];
vector <int> G[N]; int col[N];
int flg = 0;

void dfs(int u){
    for(int v : G[u]){
        if(col[v] == -1){
            col[v] = col[u] ^ 1;
            dfs(v);
        }
        else{
            if(col[v] == col[u]) flg = 1;
        }
    }
}

int ec = 1,to[N << 1],nxt[N << 1],hed[N],cap[N << 1];
void add_edge(int f,int t,int c){
    if(f == -1 || t == -1) return;
    ++ ec; to[ec] = t; nxt[ec] = hed[f]; hed[f] = ec; cap[ec] = c;
    ++ ec; to[ec] = f; nxt[ec] = hed[t]; hed[t] = ec; cap[ec] = 0;
}

int lev[N],cur[N];
void bfs(int s,int t){
    queue <int> q;
    for(int i = 1;i <= t;i ++) lev[i] = 0;
    lev[s] = 1; q.push(s);
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(int v,i = hed[u];i;i = nxt[i]){
            v = to[i];
            if(cap[i] && !lev[v]){
                lev[v] = lev[u] + 1;
                q.push(v);
            }
        }
    }
}

int dfs(int u,int t,int f){
    if(u == t) return f;
    for(int v,i = cur[u];i;i = nxt[i]){
        v = to[i]; cur[u] = i;
        if(lev[v] == lev[u] + 1 && cap[i]){
            int tmp = dfs(v,t,min(f,cap[i]));
            if(tmp){
                cap[i] -= tmp;
                cap[i ^ 1] += tmp;
                return tmp;
            }
        }
    }
    return 0;
}

int mxf = 0;
void dinic(int s,int t){
    while(1){
        bfs(s,t);
        if(!lev[t]) break;
        for(int i = 1;i <= t;i ++) cur[i] = hed[i];
        int f;
        while(1){
            f = dfs(s,t,0x3f3f3f3f);
            if(!f) break;
            mxf += f;
        }
    }
}

bool solve(){
    cin >> n >> m;
    n = (n << 1) - 1;
    m = (m << 1) - 1;
    int S = get_id(n,m) + 1;
    int T = S + 1;
    int cnt7 = 0;
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= m;j ++){
            char ch; cin >> ch;
            if(ch >= '1' && ch <= '9') num[i][j] = ch - '0';
            if(ch == '2' || ch == '3'){
                int u = get_id(i == 1 ? 2 : n - 1,j);
                int v = get_id(i,j == 1 ? 2 : m - 1);
                if(ch == '2') G[u].push_back(v),G[v].push_back(u);
                else G[0].push_back(u),G[0].push_back(v);
            }
            if(ch == '4' || ch == '5'){
                int u,v;
                if(i == 1 || i == n) u = get_id(i,j - 1),v = get_id(i,j + 1);
                if(j == 1 || j == m) u = get_id(i - 1,j),v = get_id(i + 1,j);
                if(ch == '4') G[u].push_back(v),G[v].push_back(u);
                else G[0].push_back(u),G[0].push_back(v);
            }
            if(ch == '7'){
                if(((i >> 1) + (j >> 1)) & 1) add_edge(get_id(i,j),T,1);
                else add_edge(S,get_id(i,j),1);
                cnt7 ++;
            }
        }
    }
    for(int i = 3;i <= n - 2;i += 2){
        for(int j = 3;j <= m - 2;j += 2){
            int u = get_id(i,j);
            if(num[i][j] != 7) continue;
            int v = -1,w = -1;
            if(i < n - 2 && num[i + 2][j] == 7) v = get_id(i + 2,j);
            if(j < m - 2 && num[i][j + 2] == 7) w = get_id(i,j + 2);
            if(((i >> 1) + (j >> 1)) & 1) add_edge(v,u,1),add_edge(w,u,1);
            else add_edge(u,v,1),add_edge(u,w,1);
        }
    }

    memset(col,-1,sizeof(col));
    col[0] = 0; dfs(0);
    for(int i = 1;i <= get_id(n,m);i ++){
        if(col[i] == -1){
            col[i] = 0;
            dfs(i);
        }
    }
    if(flg) return 0;

    dinic(S,T);
    if((mxf << 1) < cnt7) return 0;
    for(int i = 2;i <= n - 1;i ++){
        for(int j = 2;j <= m - 1;j ++){
            col[get_id(i,j)] = 1;
        }
    }
    for(int i = 3;i <= n - 2;i += 2){
        for(int j = 3;j <= m - 2;j += 2){
            if(((i >> 1) + (j >> 1)) & 1) continue;
            if(num[i][j] == 8) continue;
            int u = get_id(i,j),mt = -1;
            for(int v,e = hed[u];e;e = nxt[e]){
                v = to[e];
                if(v == S || v == T) continue;
                if(cap[e ^ 1]) mt = v;
            }
            // cout << u << ',' << mt << endl;
            if(mt == get_id(i + 2,j)) col[get_id(i + 1,j)] = 0;
            if(mt == get_id(i,j + 2)) col[get_id(i,j + 1)] = 0;
            if(mt == get_id(i - 2,j)) col[get_id(i - 1,j)] = 0;
            if(mt == get_id(i,j - 2)) col[get_id(i,j - 1)] = 0;
        }
    }

    cout << "YES\n";
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= m;j ++){
            if(num[i][j]) cout << num[i][j];
            else cout << (col[get_id(i,j)] ? '#' : '.');
        }
        cout << '\n';
    }
    return 1;
}

int main(){
    ios::sync_with_stdio(false);
    if(!solve()) cout << "NO\n";
    return 0;
}