#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF=1e18;
int n,m;
int S,T;
int ban[2005][2005];
int dis[1000005];
int a[2005][2005];
int ecnt=1,nxt[1000005],head[1000005],val[1000005],cur[1000005],to[1000005];
void add_edge(int u,int v,int w){
	nxt[++ecnt]=head[u];
	to[ecnt]=v;
	head[u]=ecnt;
	val[ecnt]=w;
	nxt[++ecnt]=head[v];
	head[v]=ecnt;
	to[ecnt]=u;
	val[ecnt]=0;
}
bool bfs(){
	queue<int>q;
	memcpy(cur,head,sizeof cur);
	q.push(S);
	for(int i=S;i<=T;i++) dis[i]=-1;
	dis[S]=0;
	while(!q.empty()){
		int x=q.front();
		q.pop();
		for(int e=head[x];e;e=nxt[e]){
			int v=to[e],w=val[e];
			if((!w)||dis[v]!=-1) continue;
			dis[v]=dis[x]+1;
			q.push(v);
		}
	}
	return dis[T]!=-1;
}
int dfs(int x,int in){
	if(x==T) return in;
	int out=0;
	for(int e=cur[x];e;e=nxt[e]){
		cur[x]=e;
		int v=to[e],w=val[e];
		if((!w)||dis[v]!=dis[x]+1) continue;
		int tmp=dfs(v,min(w,in-out));
		out+=tmp;
		val[e]-=tmp;
		val[e^1]+=tmp;
		if(out==in) break;
	}
	return out;
}
int dinic(){
	int ret=0;
	while(bfs()) ret+=dfs(S,INF);
	return ret;
}
int id(int x,int y){return (x-1)*m+y;}
int eid[2005][2005][4];
char ans[2005][2005];
int vx[4]={1,-1,0,0},vy[4]={0,0,1,-1};
signed main(){
	cin>>n>>m;
	S=0,T=n*m+1;
	char ch;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			ch=getchar();
			while(ch<'1'||ch>'9') ch=getchar();
			a[i][j]=ch-'0';
			int cnt=(i==1||i==n)+(j==1||j==m);
			if(cnt==2) a[i][j]-=3;
			else if(cnt==1) a[i][j]-=5;
			else a[i][j]-=8;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			ban[i][j]=-1;
			if(i==1&&j!=1&&j!=m) ban[i][j]=0;
			if(i==n&&j!=1&&j!=m) ban[i][j]=1;
			if(j==1&&i!=1&&i!=n) ban[i][j]=2;
			if(j==m&&i!=1&&i!=n) ban[i][j]=3;
		}
	}
	int tot=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==0) continue;
			tot++;
			for(int k=0;k<4;k++){
				int ni=i+vx[k],nj=j+vy[k];
				if(ni<1||ni>n||nj<1||nj>m) continue;
				if(k==ban[i][j]||(k^1)==ban[ni][nj]) continue;
				if(ni<i||nj<j) continue;
				if(a[ni][nj]!=-1) continue;
				eid[i][j][k]=ecnt+1;
				if((i&1)^(j&1)) add_edge(id(i,j),id(ni,nj),1);
				else add_edge(id(ni,nj),id(i,j),1);
			}
			if((i&1)^(j&1)) add_edge(S,id(i,j),1);
			else add_edge(id(i,j),T,1); 
		}
	}
	if(tot&1){
		puts("NO");
		return 0;
	}
	int ret=dinic();
	if(ret!=tot/2){
		puts("NO");
		return 0;
	}
	puts("YES");
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int cnt=(i==1||i==n)+(j==1||j==m);
			if(cnt==2) ans[2*i-1][2*j-1]=a[i][j]+3+'0';
			else if(cnt==1) ans[2*i-1][2*j-1]=a[i][j]+5+'0';
			else ans[2*i-1][2*j-1]=a[i][j]+8+'0';
			
		}
	}
	for(int i=2;i<=2*n-1;i+=2) for(int j=1;j<=2*m-1;j++) ans[i][j]='#';
	for(int j=2;j<=2*m-1;j+=2) for(int i=1;i<=2*n-1;i++) ans[i][j]='#';
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==0) continue;
			tot++;
			for(int k=0;k<4;k++){
				int ni=i+vx[k],nj=j+vy[k];
				if(ni<1||ni>n||nj<1||nj>m) continue;
				if(k==ban[i][j]||(k^1)==ban[ni][nj]) continue;
				if(ni<i||nj<j) continue;
				if(a[ni][nj]!=-1) continue;
				if(!val[eid[i][j][k]]){
					int posx=2*i-1+vx[k],posy=2*j-1+vy[k];
					ans[posx][posy]='.';
				}
			}
		}
	}
	for(int i=1;i<=2*n-1;i++){
		for(int j=1;j<=2*m-1;j++) printf("%c",ans[i][j]);
		puts("");
	}
	return 0;
}