#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pil>vpil;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=2000010;
const int inf=0x7fffffff;
const ll INF=0x7fffffffffffffff;
int ent=1,S,T,tot;
int head[N],cur[N],dis[N]; 
struct Edge{
	int nxt,to;
	ll fl;
}e[N<<1];
inline void addedge(int x,int y,int w){
	e[++ent]={head[x],y,w};head[x]=ent;
	e[++ent]={head[y],x,0};head[y]=ent;
}
bool bfs(){
	for(int i=1;i<=tot;i++)cur[i]=head[i],dis[i]=inf;
	dis[S]=0;queue<int>q;q.push(S);
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].to;ll w=e[i].fl;
			if(w){
				if(dis[v]>dis[x]+1){
					dis[v]=dis[x]+1;
					q.push(v);
				}
			}
		}
	}
	return dis[T]!=inf;
}
ll dfs(int x,ll flow){
	if(x==T)return flow;
	ll fl=0;
	for(int i=cur[x];i&&fl<flow;i=e[i].nxt){
		cur[x]=i;
		int v=e[i].to;ll w=e[i].fl;
		if(w && dis[v]==dis[x]+1){
			ll of=dfs(v,min(w,flow-fl));
			fl+=of;e[i].fl-=of;e[i^1].fl+=of;
		}
	}
	return fl;
}
ll dinic(){
	ll s=0;
	while(bfs())
		s+=dfs(S,INF);
	return s;
}
int n,m;
char s[210][210];
int a[210][210],p[210][210];
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n);read(m);
	n=2*n-1,m=2*m-1; 
	for(int i=1;i<=n;i++){
		scanf("%s",s[i]+1);
	}
	S=++tot;T=++tot;
	int rct=0;
	for(int i=1;i<=n;i+=2){
		for(int j=1;j<=m;j+=2){
			int t=8;
			if((i==1||i==n)&&(j==1||j==m))t=3;
			else if((i==1||i==n)||(j==1||j==m))t=5;
			a[i][j]=((s[i][j]-'0')!=t);
			if(a[i][j]){
//				dpi(i/2+1,j/2+1);
				++rct;
				p[i][j]=++tot;
				if((i/2+j/2)&1)addedge(S,p[i][j],1);
				else addedge(p[i][j],T,1);
			}
		}
	}
	for(int i=1;i<=n;i+=2)
		for(int j=1;j<=m;j+=2)if(a[i][j] && ((i/2+j/2)&1)){
//			dpi(i,j);
			if(i<n && a[i+2][j] && !(j>1&&j<m&&(i==n-2||i==1)))addedge(p[i][j],p[i+2][j],1);
			if(i>1 && a[i-2][j] && !(j>1&&j<m&&(i==3||i==n)))addedge(p[i][j],p[i-2][j],1);
			if(j<m && a[i][j+2] && !(i>1&&i<n&&(j==m-2||j==1)))addedge(p[i][j],p[i][j+2],1);
			if(j>1 && a[i][j-2] && !(i>1&&i<n&&(j==3||j==m)))addedge(p[i][j],p[i][j-2],1);
		}
	int flow=dinic();
	if(flow*2==rct){
		puts("YES");
		int ct=1;
		for(int i=1;i<=n;i+=2)
			for(int j=1;j<=m;j+=2)
				if(a[i][j])
					ct+=2;
		for(int i=1;i<=n;i+=2)
			for(int j=1;j<=m;j+=2)if(a[i][j] && ((i/2+j/2)&1)){
				if(i<n && a[i+2][j] && !(j>1&&j<m&&(i==n-2||i==1))){
					if(!e[ct+1].fl)
						s[i+1][j]='#';
					ct+=2;
				}
				if(i>1 && a[i-2][j] && !(j>1&&j<m&&(i==3||i==n))){
					if(!e[ct+1].fl)
						s[i-1][j]='#';
					ct+=2;
				}
				if(j<m && a[i][j+2] && !(i>1&&i<n&&(j==m-2||j==1))){
					if(!e[ct+1].fl)
						s[i][j+1]='#';
					ct+=2;
				}
				if(j>1 && a[i][j-2] && !(i>1&&i<n&&(j==3||j==m))){
					if(!e[ct+1].fl)
						s[i][j-1]='#';
					ct+=2;
				}
			}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)
				if(s[i][j]=='.')s[i][j]='#';
				else if(s[i][j]=='#')s[i][j]='.';
			printf("%s\n",s[i]+1);
		}
	}
	else puts("NO");
    #ifdef do_while_true
		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}