#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k << 1
#define RC k << 1 | 1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110;
const int M = 2600;
const int mod = 998244353;
const int inf = 1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, m;
string t[N];
int a[N][N], d[N][N], idx[N][N];
vector<int> g[M];
int nx, ny, tx[M], ty[M], dx[M], dy[M], dis;
bool flag[M];
const int wayx[4] = {0, 0, -1, 1};
const int wayy[4] = {1, -1, 0, 0};
PII al[M], ar[M];
bool bfs() {
	queue<int> q;
	dis = inf;
	memset(dx, -1, sizeof(dx));
	memset(dy, -1, sizeof(dy));
	repn(i, 1, nx) if (tx[i] == -1) q.push(i), dx[i] = 0;
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		if (dx[u] > dis) break;
		for (auto v: g[u]) {
			if (dy[v] == -1) {
				dy[v] = dx[u] + 1;
				if (ty[v] == -1) dis = dy[v];
				else {
					dx[ty[v]] = dy[v] + 1;
					q.push(ty[v]);
				}
			}
		}
	}
	return dis != inf;
}
bool dfs(int u) {
	for (auto v: g[u]) {
		if (!flag[v] && dy[v] == dx[u] + 1) {
			flag[v] = 1;
			if (ty[v] != -1 && dy[v] == dis) continue;
			if (ty[v] == -1 || dfs(ty[v])) {
				ty[v] = u;
				tx[u] = v;
				return 1;
			}
		}
	}
	return 0;
}
int HC() {
	int ans = 0;
	memset(tx, -1, sizeof(tx));
	memset(ty, -1, sizeof(ty));
	while (bfs()) {
		memset(flag, 0, sizeof(flag));
		repn(i, 1, nx) if (tx[i] == -1 && dfs(i)) ans++;
	}
	repn(i, 1, nx) g[i].clear();
	return ans;
}
int main() {
	cin >> n >> m;
	rep(i, 0, n + n - 1) {
		string s;
		cin >> s;
		if (i % 2 == 0) {
			rep(j, 0, m + m - 1) {
				if (j % 2 == 0) a[i / 2][j / 2] = s[j] - '0';
			}
		}
		t[i] = s;
	}
	rep(i, 0, n) rep(j, 0, m) {
		int res, f1 = 0, f2 = 0;
		if (i == 0 || i == n - 1) f1 = 1;
		if (j == 0 || j == m - 1) f2 = 1;
		if (f1 && f2) res = 3;
		else if (f1 || f2) res = 5;
		else res = 8;
		d[i][j] = res - a[i][j];
	}
	rep(i, 0, n) rep(j, 0, m) {
		int op = (i + j) & 1;
		if (d[i][j] == 0) continue;
		if (op == 0) nx++, idx[i][j] = nx, al[nx] = mp(i, j);
		else ny++, idx[i][j] = ny, ar[ny] = mp(i, j);
	}
	if (nx != ny) {
		cout << "NO\n";
		return 0;
	}
	rep(i, 0, n) rep(j, 0, m) {
		int op = (i + j) & 1;
		if (op == 0) {
			rep(k, 0, 4) {
				int nx = i + wayx[k], ny = j + wayy[k];
				if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
				if (d[nx][ny] == 0) continue;
				int fl = 0, fr = 0;
				if (i == 0 || i == n - 1 || j == 0 || j == m - 1) fl = 1;
				if (nx == 0 || nx == n - 1 || ny == 0 || ny == m - 1) fr = 1;
				if (fl ^ fr) continue;
				int cl = 0, cr = 0;
				if (i == 0 || i == n - 1) cl++;
				if (j == 0 || j == m - 1) cl++;
				if (nx == 0 || nx == n - 1) cr++;
				if (ny == 0 || ny == m - 1) cr++;
				if (fl && fr && cl != 2 && cr != 2) {
					if (i == 0 && nx == n - 1) continue;
					if (i == n - 1 && nx == 0) continue;
					if (j == 0 && ny == m - 1) continue;
					if (j == m - 1 && ny == 0) continue;
				}
				g[idx[i][j]].pb(idx[nx][ny]);
			}
		}
	}
	int ans = HC();
	if (ans != nx) {
		cout << "NO\n";
		return 0;
	}
	cout << "YES\n";
	rep(i, 0, n + n - 1) rep(j, 0, m + m - 1) {
		if (t[i][j] == '.') t[i][j] = '#';
	}
	repn(i, 1, nx) {
		int x1 = al[i].fi, y1 = al[i].se;
		int x2 = ar[tx[i]].fi, y2 = ar[tx[i]].se;
		int idx = x1 * 2, idy = y1 * 2;
		if (x1 == x2 && y1 + 1 == y2) {
			t[idx][idy + 1] = '.';
		}
		else if (x1 == x2 && y1 - 1 == y2) {
			t[idx][idy - 1] = '.';
		}
		else if (y1 == y2 && x1 + 1 == x2) {
			t[idx + 1][idy] = '.';
		}
		else {
			t[idx - 1][idy] = '.';
		}
	}
	rep(i, 0, n + n - 1) cout << t[i] << "\n";
	return 0;
}