#include<bits/stdc++.h>
#ifndef xxx
#define dbg(...) ;
#endif
using namespace std;
template<class T> ostream &operator<<(ostream &o, const vector <T> &v) { bool f=false; for(T i:v) { f?o<<' ':o; o<<(i); f=true; } return o; }
template<class T> void sort(T &v) { std::sort(v.begin(), v.end()); }
template<class T, class C> void sort(T &v, C c) { std::sort(v.begin(), v.end(), c); }
template<class T> void reverse(T &v) { std::reverse(v.begin(), v.end()); }
template<class T> bool is_sorted(T &v) { return std::is_sorted(v.begin(), v.end()); }
template<class T> inline void left_shift(T st, T ed, int shift) { std::rotate(st, st+shift, ed); }
template<class T> inline void right_shift(T st, T ed, int shift) { std::rotate(st, ed-shift, ed); }
template<class T> inline void _min(T &x, const T &y) { x>y?x=y:x; }
template<class T> inline void _max(T &x, const T &y) { x<y?x=y:x; }
istream &operator>>(istream &i, __int128_t &x) { x=0; short f=1; char c=0; while(!isdigit(c)) { if(c=='-')f=-1; c=i.get(); } while(isdigit(c))x=x*10+c-'0', c=i.get(); x*=f; return i; }
ostream &operator<<(ostream &o, __int128_t x) { if(x==0) { o<<0; return o; } bool f=false; string s; if(x<0)f=true, x=-x; while(x)s+=x%10+'0', x/=10; reverse(s); if(f)o<<'-'; o<<s; return o; }
mt19937 mt(time(0));
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
constexpr int maxn=1e4+5;
constexpr int mod=1e9+7;
constexpr int inf=0x3f3f3f3f;
constexpr ll INF=0x3f3f3f3f3f3f3f3fll;
constexpr double pi=acos(-1.0);
constexpr double eps=1e-9;
vector<int>G[maxn];
void add(int u, int v)
{
	dbg(u, v);
	G[u].push_back(v);
	G[v].push_back(u);
}
int a[105][105];
// 染色1/0
int color[maxn];
// 对于color=1的点 看是否需要匹配
bool need[maxn];
int vis[maxn];
int link[maxn];
bool Hungary(const int tot)
{
	int black=0, white=0;
	for(int i=1; i<=tot; i++)
	{
		if(need[i])
		{
			black+=color[i]==1;
			white+=color[i]==0;
		}
	}
	dbg(black, white);
	if(black!=white)return false;
	int timestamp=0;
	function<bool(int)> dfs=[&](int u)->bool
	{
		for(int v:G[u])
		{
			if(vis[v]==timestamp)continue;
			vis[v]=timestamp;
			if(link[v]==0||dfs(link[v]))
			{
				link[v]=u;
				return true;
			}
		}
		return false;
	};
	for(int i=1; i<=tot; i++)
	{
		if(!need[i]||color[i]!=1)continue;
		timestamp++;
		if(!dfs(i))
			return false;
	}
	return true;
}
const int dir[][2]=
{
	{-2, 0},
	{0, -2}
};
char s[105][105];
int main()//MARK: main
{
#ifndef xxx
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
	cout<<fixed<<setprecision(10);
	int n, m;
	cin>>n>>m;
	const int N=2*n-1;
	const int M=2*m-1;
	for(int i=1; i<=N; i++)
	{
		for(int j=1; j<=M; j++)
		{
			char c;
			cin>>c;
			s[i][j]=c;
			if(isdigit(c))
				a[i][j]=c-'0';
			else
			{
				s[i][j]='#';
			}
		}
	}
	auto to1d=[&](int x, int y)->int
	{
		return (x-1)*M+y;
	};
	auto to2d=[&](int id)->pii
	{
		int x=(id-1)/M+1;
		int y=(id-1)%M+1;
		return make_pair(x, y);
	};
	auto calcIsFull=[&](int val)->bool
	{
		return val==3||val==5||val==8;
	};
	auto calcType=[&](int val)->int
	{
		// center
		if(val>=7)return 3;
		// edge
		if(val>=4)return 2;
		// corner
		if(val>=2)return 1;
		return 0;
	};
	auto calcMid=[&](pii pu, pii pv)->pii
	{
		auto [x1, y1]=pu;
		auto [x2, y2]=pv;
		int x=x1, y=y1;
		if(x1==x2)
		{
			y=(y1+y2)/2;
		}
		else
		{
			x=(x1+x2)/2;
		}
		return make_pair(x, y);
	};
	auto checkEdge=[&](int t1, int t2, int x1, int y1, int x2, int y2) -> bool
	{
		if(t1==1||t2==1)return true;
		if(t1==3)return t2==3;
		// t1=2
		if(t2==3)return false;
		// t1=2 && t2=2
		if(x1==x2)return x1==1||x1==N;
		if(y1==y2)return y1==1||y1==M;
		return false;
	};
	for(int i=1; i<=2*n-1; i+=2)
	{
		int c=((i+1)/2)&1;
		for(int j=1; j<=2*m-1; j+=2)
		{
			int id=to1d(i, j);
			color[id]=c;
			dbg(i, j, id);
			if(!calcIsFull(a[i][j]))
			{
				int type=calcType(a[i][j]);
				//dbg(i,j,id);
				need[id]=true;
				for(auto [dx, dy]:dir)
				{
					int x=i+dx;
					int y=j+dy;
					if(!(1<=x&&1<=y))continue;
					int pre=to1d(x, y);
					if(!need[pre])continue;
					int preType=calcType(a[x][y]);
					if(checkEdge(type,preType,i,j,x,y))
					{
						add(id, pre);
					}
				}
			}
			c^=1;
		}
	}
	const int tot=N*M;
	bool flag=Hungary(tot);
	if(flag)
	{
		cout<<"YES"<<'\n';
		for(int i=1; i<=tot; i++)
		{
			if(color[i]!=0||!need[i])continue;
			int u=i;
			int v=link[i];
			auto pu=to2d(u);
			auto pv=to2d(v);
			auto mid=calcMid(pu, pv);
			s[mid.first][mid.second]='.';
		}
		for(int i=1; i<=N; i++)
		{
			cout<<s[i]+1<<'\n';
		}
	}
	else
	{
		cout<<"NO"<<'\n';
	}
	return 0;
}