#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5+7;
int n, m, n1, n2, c[N];
bool b[N];
vector<int>g[N];
bool find(int x) {
	b[x] = 1;
	for (auto y : g[x]) {
		if (c[y]==-1 || (!b[c[y]] && find(c[y]))) {
			c[y] = x;
			return 1;
		}
	}
	return 0;
}
int match() {
	int ans = 0;
	memset(c, -1, sizeof(c));
	for (int i = 0; i < n1; i++) {
		memset(b, 0, sizeof(b));
		if (find(i))
			ans++;
	}
	return ans;
}
void solve() {

	cin >> n >> m;
	vector<string> v(2*n-1);
	vector<pair<int, int>>v1;
	vector<pair<int, int>>v2;
	for (auto &s: v) {
		cin >> s;
		for (auto &c: s)
			if (c == '.') c = '#';
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (v[i * 2][j * 2] == '3' || v[i * 2][j * 2] == '5' || v[i * 2][j * 2] == '8')
				continue;
			if ((i + j) % 2)
				v1.push_back({i, j});
			else
				v2.push_back({i, j});
		}
	}
	n1 = (int)v1.size();
	n2 = (int)v2.size();
	if (n1 != n2) {
		cout << "NO";
		return;
	}
	for(int i=0;i<n1;i++){
		auto [x,y]=v1[i];
		for(int j=0;j<n2;j++){
			auto [x2,y2]=v2[j];
			bool k=((x==0&&x2==0)||(x==n-1&&x2==n-1)||(y==0&&y2==0)||(y==m-1&&y2==m-1));
			bool h=(v[2*x][2*y]=='7'&&v[2*x2][2*y2]=='7');
			int ss=fabs(x-x2)+fabs(y-y2);
			if(ss==1&&(k||h))
				g[i].push_back(j);
		}
	}
	if(match()!=n1)
		cout<<"NO";
	else{
		cout<<"YES\n";
		for (int j = 0; j < n2; ++j) {
			auto [x2, y2] = v2[j];
			int i = c[j];
			auto [x1, y1] = v1[i];
			v[x1 + x2][y1 + y2] = '.';
		}
		for(auto it:v){
			cout<<it<<'\n';
		}
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int T = 1;
//	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}