#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int zx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int zy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
char f[3010][3010];
int f1[3010][3010], g[3010][3010], st[3010], match[3010];

void solve() {
	int n, m; cin >> n >> m;
	//vector<vector<char>> f(2 * n + 1, vector<char> (2 * m + 1));
	for(int i = 1; i <= 2 * n - 1; i++) {
		for(int j = 1; j <= 2 * m - 1; j++) {
			cin >> f[i][j];
		}
	}
	int num = 0;
	//vector<vector<int>> f1(n + 1, vector<int> (m + 1, 0));
	for(int i = 1; i <= 2 * n - 1; i++) {
		for(int j = 1; j <= 2 * m - 1; j++) {
			if((i & 1) && (j & 1) && f[i][j] != '.') {
				if(f[i][j] == '2' || f[i][j] == '4' || f[i][j] == '7'){
					f1[(i + 1) / 2][(j + 1) / 2] = 1, num++;
				}
			}
		}
	}
	//vector<vector<int>> g(n * m + 1, vector<int> (n * m + 1, 0));
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			if(((i + j) & 1) && f1[i][j]) {
				if((i == 1 && j == 1) || (i == n && j == 1) || (i == 1 && j == m) || (i == n && j == m)) {
					for(int k = 0; k < 4; k++) {
						int x = dx[k] + i, y = dy[k] + j;
						if(x <= 0 || x > n || y <= 0 || y > m) continue;
						if(f1[x][y] == 0) continue;
						int id1 = (i - 1) * m + j;
						int id2 = (x - 1) * m + y;
						g[id1][id2] = 1;
					}
					continue;
				}
				if(i == 1 || i == n) {
					for(int k = 0; k < 4; k++) {
						int x = dx[k] + i, y = dy[k] + j;
						if(x <= 0 || x > n || y <= 0 || y > m) continue;
						if(x != i) continue;
						if(f1[x][y] == 0) continue;
						int id1 = (i - 1) * m + j;
						int id2 = (x - 1) * m + y;
						g[id1][id2] = 1;
					}
					continue;
				}
				if(j == 1 || j == m) {
					for(int k = 0; k < 4; k++) {
						int x = dx[k] + i, y = dy[k] + j;
						if(x <= 0 || x > n || y <= 0 || y > m) continue;
						if(y != j) continue;
						if(f1[x][y] == 0) continue;
						int id1 = (i - 1) * m + j;
						int id2 = (x - 1) * m + y;
						g[id1][id2] = 1;
					}
					continue;
				}
				for(int k = 0; k < 4; k++) {
					int x = dx[k] + i, y = dy[k] + j;
					if(x <= 1 || x >= n || y <= 1 || y >= m) continue;
					if(f1[x][y] == 0) continue;
					int id1 = (i - 1) * m + j;
					int id2 = (x - 1) * m + y;
					g[id1][id2] = 1;
				}
			}
		}
	}
	//vector<int> st(n * m + 1, 0), match(n * m + 1, 0);
	function <bool(int)> find = [&] (int x) {
		for(int i = 1; i <= m * n; i++) {
			if(st[i] || !g[x][i]) continue;
			st[i] = true;
			if(match[i] == 0 || find(match[i])) {
				match[i] = x;
				return true;
			}
		}
		return false;
	};
	int res = 0;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			if(((i + j) & 1) && find((i - 1) * m + j)) {
				for(int k = 1; k <= n * m; k++) st[k] = 0;
				res++;
			}
		}
	}
	if(res * 2 == num) {
		cout << "YES" << endl;
		for(int i = 1; i <= 2 * n - 1; i++) {
			for(int j = 1; j <= 2 * m - 1; j++) {
				if(f[i][j] == '.') f[i][j] = '#';
			}
		}
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				if(!((i + j) & 1) && f1[i][j] && match[(i - 1) * m + j]) {
					int num = match[(i - 1) * m + j];
					if(num == (i - 1) * m + j - 1) {
						f[i * 2 - 1][j * 2 - 1 - 1] = '.';
					}
					else if(num == (i - 1) * m + j + 1) {
						f[i * 2 - 1][j * 2 - 1 + 1] = '.';
					}
					else if(num == (i - 1 + 1) * m + j) {
						f[i * 2 - 1 + 1][j * 2 - 1] = '.';
					}
					else f[i * 2 - 1 - 1][j * 2 - 1] = '.';
				}
			}
		}
		for(int i = 1; i <= 2 * n - 1; i++) {
			for(int j = 1; j <= 2 * m - 1; j++) {
				cout << f[i][j];
			}
			cout << endl;
		}
	}
	else cout << "NO" << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(12);
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
	return 0 - 0;
}