#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
using namespace std;
#define int long long
const int N=1e4+7,M=1e5+7,inf=0x3f3f3f3f;
int n,m,S,T;
struct node {
    int u,v,nxt,cap;
}e[M<<3];
int head[N],tot=1;
void add(int u,int v,int cap) {
    e[++tot].v=v;
    // if(cap) cout<<u<<" "<<v<<"\n";
    e[tot].u=u;
    e[tot].cap=cap;
    e[tot].nxt=head[u];
    head[u]=tot;
}
int dis[N];
bool bfs() {
    memset(dis,-1,sizeof(dis));
    queue<int> q;
    q.push(S);
    dis[S]=0;
    while(!q.empty()) {
        int u=q.front();
        q.pop();
        for(int i=head[u];i;i=e[i].nxt) {
            int v=e[i].v;
            if(dis[v]==-1&&e[i].cap) {
                dis[v]=dis[u]+1;
                q.push(v);
            }
        }
    }   
    return dis[T]!=-1;
}
int dfs(int u,int f) {
    if(u==T) return f;
    int rest=f;
    for(int i=head[u];i;i=e[i].nxt) {
        int v=e[i].v;
        if(dis[v]==dis[u]+1&&e[i].cap&&rest) {
            int t=dfs(v,min(e[i].cap,rest));
            if(!t) dis[v]=0;
            e[i].cap-=t;
            e[i^1].cap+=t;
            rest-=t;
        }
    }
    return f-rest;
}
int dinic() {
    int ans=0;
    while(bfs()) ans+=dfs(S,inf);
    return ans;
}
char s[200][200];
int dsr_cnt;
map<array<int,2>,int> mp,ok;
map<int,array<int,2>> Q;
int id(int x,int y) {
    if(mp.count({x,y})) return mp[{x,y}];
    mp[{x,y}]=++dsr_cnt;
    Q[dsr_cnt]={x,y};
    return mp[{x,y}];
}
std::vector<int> g[100000];
void addedge(int u,int v) {
    // cout<<u<<" "<<v<<"\n";
    g[u].push_back(v);
    g[v].push_back(u);
}
int col[100000];
void dfs(int u,int fa,int color) {
    col[u]=color+1;
    for(auto v:g[u]) {        
        if(v==fa) continue;
        if(col[v]) continue;
        dfs(v,u,(color+1)%2);
    }
}
bool cal(int x,int y,int l,int r) {
    if(x==y&&x==l) return 1;
    if(x==y&&x==r) return 1;
    return 0;
}
signed main() {
    #ifdef ONLINE_JUDGE
    #else
        freopen("a.in","r",stdin);
        // freopen("a.out","w",stdout);
    #endif
    cin>>n>>m;
    n=n+n-1,m=m+m-1;
    FOR(i,1,n) cin>>(s[i]+1);
    FOR(i,1,n) FOR(j,1,m) if(s[i][j]=='4'||s[i][j]=='2'||s[i][j]=='7') id(i,j); 
    FOR(i,1,n) FOR(j,1,m) if(s[i][j]=='4'||s[i][j]=='2') {
        FOR(ii,1,n) FOR(jj,1,m) if(s[ii][jj]=='4'||s[ii][jj]=='2') {
            if(abs(i-ii)+abs(j-jj)==2&&(cal(i,ii,1,n)||cal(j,jj,1,m))) {
                addedge(id(i,j),id(ii,jj));

            }
        }
    }
    FOR(i,1,n) FOR(j,1,m) if(s[i][j]=='7') {
        FOR(ii,1,n) FOR(jj,1,m) if(s[ii][jj]=='7') {
            if(abs(i-ii)+abs(j-jj)==2) {
                addedge(id(i,j),id(ii,jj));
            }
        }
    }
    FOR(i,1,dsr_cnt) if(col[i]==0) dfs(i,0,0);
    S=1+dsr_cnt;
    T=2+dsr_cnt;
    // cout<<dsr_cnt<<"\n";
    // FOR(i,1,dsr_cnt) cout<<col[i]<<"\n";
    FOR(u,1,dsr_cnt) {
        if(col[u]==1) {
            add(S,u,1),add(u,S,0);
        } else {
            add(u,T,1),add(T,u,0);
        }
    }
    FOR(u,1,dsr_cnt) if(col[u]==1){
        for(auto v:g[u]) if(col[v]==2){
            add(u,v,1),add(v,u,0);
        }
    }
    // return 0;
    int ans=dinic();
    // cout<<ans<<"1\n";
    if(dsr_cnt%2==1) return cout<<"NO\n",0;
    if(dsr_cnt/2!=ans) return cout<<"NO\n",0;
    for(int i=2;i<=tot;i+=2) {
        if(e[i].u==S||e[i].u==T) continue;
        if(e[i].v==S||e[i].v==T) continue;
        if(e[i].cap==0) {
            auto [x,y]=Q[e[i].u];
            auto [a,b]=Q[e[i].v];
            // cout<<x<<","<<y<<" "<<a<<","<<b<<"\n";
            s[(x+a)/2][(y+b)/2]='#';
        }
    }
    cout<<"YES\n";
    FOR(i,1,n) {
        FOR(j,1,m) {
            if(s[i][j]=='.') cout<<"#";
            else if(s[i][j]=='#') cout<<".";
            else cout<<s[i][j];
        } cout<<'\n';
    }
    return 0;
}