#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m;
const int N=63000;
int head[N],ver[N*2],Next[N*2],tot;
int visit[N],match[N];
char s[1005][1005];
int a[300][300],b[300][300],c[300][300];
int xx[4]={1,0,-1,0},yy[4]={0,1,0,-1};
int ans=0,sum=0,sum1=0,sum2=0;
int x1[N],y1[N],x2[N],y2[N];
void ds()
{
    cin>>n>>m;
    for(int i=0;i<=2*n-2;i++)
    {
        scanf("%s",s[i]);
        for(int j=0;j<2*m-1;j++)
        {
            if(s[i][j]=='.')s[i][j]='#';
        }
        if(i%2==0)
        {
            for(int j=0;j<=2*m-2;j+=2)
            {
                if(s[i][j]=='2'||s[i][j]=='4'||s[i][j]=='7')
                {
                    a[i/2][j/2]=1;
                    sum++;
                }
            }
        }
    }

}
void add(int x,int y)
{
    ver[++tot]=y;
    Next[tot]=head[x];
    head[x]=tot;
}
bool pan(int x1,int y1,int x2,int y2)
{
    if(x1==0||x1==n-1||y1==0||y1==m-1)
    {
        if(x2==0||x2==n-1||y2==0||y2==m-1)
        {
            int x=x1+x2,y=y1+y2;
            if(x==0||y==0||x==n*2-2||y==m*2-2)return 0;
            else return 1;
        }
        else return 1;
    }
    return 0;
}
void ycl()
{
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if((i+j)%2&&a[i][j]==1)
            {
                sum1++;
                x1[sum1]=i;
                y1[sum1]=j;
                c[i][j]=sum1;
            }
            if((i+j)%2==0&&a[i][j]==1)
            {
                sum2++;
                x2[sum2]=i;
                y2[sum2]=j;
                b[i][j]=sum2;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if((i+j)%2)
            {
                if(a[i][j]==0)continue;
                for(int t=0;t<4;t++)
                {
                    int x=i+xx[t],y=j+yy[t];
                    if(x>=0&&x<n&&y>=0&&y<m)
                    {
                        if(a[x][y])
                        {
                            if(pan(i,j,x,y))continue;
                            //cout<<x1[c[i][j]]<<" "<<y1[c[i][j]]<<"-"<<x2[b[x][y]]<<" "<<y2[b[x][y]]<<endl;
                            add(c[i][j],b[x][y]);
                        }
                    }
                }
            }
        }
    }
}
bool dfs(int x)
{
    for(int i=head[x],y;i;i=Next[i])
    {
        if(!visit[y=ver[i]])
        {
            visit[y]=1;
            if(!match[y]||dfs(match[y]))
            {
                match[y]=x;
                return true;
            }
        }
    }
    return false;
}
int js()
{
    //cout<<" "<<sum1<<" "<<sum2<<endl;
    if(sum%2||sum1!=sum2)return -1;
    for(int i=1;i<=sum1;i++)
    {
        memset(visit,0,sizeof(visit));
        if(dfs(i))ans++;
    }
    //cout<<ans<<endl;
    if(ans!=sum1)return -1;
    for(int i=1;i<=sum2;i++)
    {
        int t=match[i];
        int mx2=x2[i],my2=y2[i],mx1=x1[t],my1=y1[t];
        //cout<<mx1<<" "<<my1<<" "<<mx2<<" "<<my2<<endl;
        for(int j=0;j<4;j++)
        {
            int x=xx[j]+mx1,y=yy[j]+my1;
            if(x==mx2&&y==my2)
            {
                s[mx1*2+xx[j]][my1*2+yy[j]]='.';
                break;
            }
        }
    }
    return 0;
}
void sc()
{
    printf("YES\n");
    for(int i=0;i<n*2-1;i++)
    {
        printf("%s\n",s[i]);
    }
}
int main()
{
    ds();
    ycl();
    int md=js();
    if(md==-1)
    {
        printf("NO");
        return 0;
    }
    sc();
    return 0;
}