#include <bits/stdc++.h>
using namespace std;

const int N = 55;
const int S = 2505;
const int M = 1e4 + 5;

int n, m, tot = 1, s, t, a[N][N], h[S], cur[S], lv[S];
char ans[N * 2][N * 2];
queue<int> q;

struct E {
	int v, w, nxt;
} e[M];

void add(int u, int v) {
	e[++tot].v = v;
	e[tot].w = 1;
	e[tot].nxt = h[u];
	h[u] = tot;
	e[++tot].v = u;
	e[tot].w = 0;
	e[tot].nxt = h[v];
	h[v] = tot;
}

bool bfs() {
	memset(lv, -1, sizeof(lv));
	lv[s] = 0;
	q.push(s);
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = h[u]; i; i = e[i].nxt) {
			int v = e[i].v, w = e[i].w;
			if (w > 0 && lv[v] == -1) {
				lv[v] = lv[u] + 1;
				q.push(v);
			}
		}
	}
	return lv[t] != -1;
}

int dfs(int u, int mn) {
	if (u == t) {
		return mn;
	}
	int sum = 0;
	for (int &i = cur[u]; i; i = e[i].nxt) {
		int v = e[i].v, w = e[i].w;
		if (w > 0 && lv[v] == lv[u] + 1) {
			int f = dfs(v, min(mn, w));
			sum += f;
			mn -= f;
			e[i].w -= f;
			e[i ^ 1].w += f;
			if (mn == 0) {
				break;
			}
		}
	}
	return sum;
}

int dinic() {
	int res = 0;
	while (bfs()) {
		for (int i = 0; i <= t; i++) {
			cur[i] = h[i];
		}
		res += dfs(s, 1e9);
	}
	return res;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n * 2 - 1; i++) {
		for (int j = 1; j <= m * 2 - 1; j++) {
			char c;
			cin >> c;
			ans[i][j] = c;
			if (c == '.') {
				ans[i][j] = '#';
				continue;
			}
			a[i / 2][j / 2] = c == '2' || c == '4' || c == '7';
		}
	}
	s = n * m + 1;
	t = n * m + 2;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (!a[i][j]) {
				continue;
			}
			if (i + j & 1) {
				add(i * m + j, t);
			} else {
				add(s, i * m + j);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (!a[i][j] || i + j & 1) {
				continue;
			}
			if (i + 1 < n && a[i + 1][j] && (j == 0 || j == m - 1 || i != 0 && i + 1 != n - 1)) {
				add(i * m + j, (i + 1) * m + j);
			}
			if (i - 1 >= 0 && a[i - 1][j] && (j == 0 || j == m - 1 || i != n - 1 && i - 1 != 0)) {
				add(i * m + j, (i - 1) * m + j);
			}
			if (j + 1 < m && a[i][j + 1] && (i == 0 || i == n - 1 || j != 0 && j + 1 != m - 1)) {
				add(i * m + j, i * m + j + 1);
			}
			if (j - 1 >= 0 && a[i][j - 1] && (i == 0 || i == n - 1 || j != m - 1 && j - 1 != 0)) {
				add(i * m + j, i * m + j - 1);
			}
		}
	}
	dinic();
	for (int i = h[s]; i; i = e[i].nxt) {
		if (e[i].w == 1) {
			cout << "NO\n";
			return 0;
		}
	}
	for (int i = h[t]; i; i = e[i].nxt) {
		if (e[i].w == 0) {
			cout << "NO\n";
			return 0;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (!a[i][j] || i + j & 1) {
				continue;
			}
			int u = i * m + j;
			for (int t = h[u]; t; t = e[t].nxt) {
				int v = e[t].v, w = e[t].w;
				if (w == 0 && v != t) {
					int x = v / m;
					int y = v % m;
					if (x == i - 1) {
						ans[i * 2][j * 2 + 1] = '.';
					} else if (x == i + 1) {
						ans[i * 2 + 2][j * 2 + 1] = '.';
					} else if (y == j - 1) {
						ans[i * 2 + 1][j * 2] = '.';
					} else if (y == j + 1) {
						ans[i * 2 + 1][j * 2 + 2] = '.';
					}
				}
			}
		}
	}
	cout << "YES\n";
	for (int i = 1; i <= n * 2 - 1; i++) {
		for (int j = 1; j <= m * 2 - 1; j++) {
			cout << ans[i][j];
		}
		cout << '\n';
	}

	return 0;
}