#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f3f3f3f3f

int n,m;
int a[555][555],id[555][555],tot1,tot2;

#define N 1505
bitset<N>e[N],nvis;
int bel[maxn];
int q[maxn],hd,tl,prex[maxn],prey[maxn];
int bfs(int s){
	q[hd=tl=1]=s,nvis.set();
	int p=0;
	while(hd<=tl){
		int u=q[hd++];
		bitset<N>now=e[u]&nvis;
		for(int v=now._Find_first();v!=N;v=now._Find_next(v)){
			nvis.reset(v);
			int x=bel[v];
			if(x)q[++tl]=x,prex[x]=u,prey[x]=v;
			else bel[v]=p=u;
			if(p)break;
		}
		if(p)break;
	}
	if(!p)return 0;
	for(int i=p;i!=s;i=prex[i]) bel[prey[i]]=prex[i];
	return 1;
}

int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};

string res[666];

signed main()
{
	n=read(),m=read();
	For(ii,1,n*2-1){
		string mp;
		cin>>mp;
		res[ii]=" "+mp;
		For(j,1,m*2-1)if(res[ii][j]=='.')res[ii][j]='#';
		if(ii%2==0)continue;
		int i=(ii+1)/2;
		For(jj,1,m*2-1){
			if(jj%2==0)continue;
			int x=mp[jj-1]&15;
			int j=(jj+1)/2;
			a[i][j]=x;
		}
	}
//	For(i,1,n)For(j,1,m)cout<<a[i][j]<<" \n"[j==m];
	For(i,1,n)
		For(j,1,m){
			int c=((i==1||i==n));
			c+=((j==1||j==m));
			if(c==2)a[i][j]=3-a[i][j];
			else if(c==1)a[i][j]=5-a[i][j];
			else a[i][j]=8-a[i][j];
			if(a[i][j]){
				if((i+j)%2==0)id[i][j]=++tot1;
				else id[i][j]=++tot2;
			}
		}
//	For(i,1,n)
	//	For(j,1,m){
//			cout<<id[i][j]<<" \n"[j==m];
//		}
	if(tot1!=tot2){
		puts("NO");
		exit(0);
	}
	For(i,1,n)
		For(j,1,m)
			if((i+j)%2==0 && id[i][j]){
				int c=((i==1||i==n));
				c|=((j==1||j==m));
				For(k,0,3){
					int ii=i+dx[k],jj=j+dy[k];
					if(ii<1||jj<1||ii>n||jj>m)continue;
					int cc=(ii==1||ii==n||jj==1||jj==m);
					if(cc!=c)continue;
					if(n==2){
						if(i!=ii && (j>1&&j<m)) continue;
					}
					if(m==2){
						if(j!=jj && (i>1&&j<n)) continue;
					}
					if(id[ii][jj]) e[id[i][j]].set(id[ii][jj]);
				}
			}
	For(i,1,tot1) if(!bfs(i)) puts("NO"),exit(0);
	For(i,1,n)
		For(j,1,m){
			if((i+j)%2 && id[i][j]){
				int u=bel[id[i][j]];
				For(k,0,3){
					int ii=i+dx[k],jj=j+dy[k];
					if(ii<1||jj<1||ii>n||jj>m)continue;
					if(id[ii][jj]==u){
						res[i+ii-1][j+jj-1]='.';
						break;
					}
				}
			}
		}
	puts("YES");
	For(i,1,n*2-1){
		For(j,1,m*2-1)putchar(res[i][j]);
		puts("");
	}
	return 0;
}
/*

2 6
3.5.4.5.5.3
...........
3.5.4.5.5.3


5 6
3.5.5.5.5.3
...........
5.7.7.7.7.5
...........
5.7.7.7.8.5
...........
5.7.7.7.8.5
...........
3.5.4.4.5.3

YES
3#5#5#5#5#3
###########
5#8#8#8#8#5
###########
5#8#8#8#8#5
###########
5#8#8#8#8#5
###########
3#5#5#5#5#3

*/