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

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rand_int(int a, int b) {
	return uniform_int_distribution<int>(a, b)(mt);
}

namespace maroonrk {

#define all(x) x.begin(), x.end()
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define pb push_back

template<class E>
struct bipartitematching{
	int n,m;
	vvc<E> g;
	vi dist,vis;
	vi to,ot;
	int sz;
	bipartitematching(int nn,int mm):n(nn),m(mm),g(n),
	dist(n),vis(n),to(n,-1),ot(m,-1),sz(0){}
	void ae(int a,E e){
		//cerr << "(" << a << ", " << e << ")" <<endl;
		g[a].pb(e);
	}
	void bfs(){
		fill(all(dist),-1);
		vi q;
		int h=0;
		auto rc=[&](int v,int d){
			if(v==-1||dist[v]!=-1)return;
			dist[v]=d;
			q.pb(v);
		};
		rep(i,n)if(to[i]==-1)rc(i,0);
		while(h<(int)q.size()){
			int v=q[h++];
			for(auto e:g[v])
				rc(ot[e],dist[v]+1);
		}
	}
	bool dfs(int v){
		if(vis[v])return 0;
		vis[v]=1;
		for(auto e:g[v]){
			if(ot[e]==-1||(dist[v]+1==dist[ot[e]]&&dfs(ot[e]))){
				to[v]=e;
				ot[e]=v;
				return 1;
			}
		}
		return 0;
	}
	void calc(){
		while(1){
			bfs();
			fill(all(vis),0);
			int f=0;
			rep(i,n)if(to[i]==-1)
				if(dfs(i))f++;
			if(f==0)break;
			sz+=f;
		}
	}
};

} // namespace maroonrk

void my_ass() {
	cout << "NO" << '\n';
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	const bool debug = false;

	while (true) {
		int N, M;
		if (!debug) {
			cin >> N >> M;
		} else {
			N = rand_int(2, 5);
			M = rand_int(2, 5);
		}
		vector<string> grid(2*N-1);
		for (int x = 0; x < 2*N-1; x++) {
			if (!debug) {
				cin >> grid[x];
			} else {
				grid[x] = string(2*M-1, '.');
			}
		}

		if (debug) {
			auto is_border_x = [&](int x) -> bool {
				return x == 0 || x == N-1;
			};
			auto is_border_y = [&](int y) -> bool {
				return y == 0 || y == M-1;
			};
			for (int x = 0; x < N; x++) {
				for (int y = 0; y < M; y++) {
					int v;
					if (is_border_x(x) && is_border_y(y)) {
						v = rand_int(2, 3);
					} else if (is_border_x(x) || is_border_y(y)) {
						v = rand_int(4, 5);
					} else {
						v = rand_int(7, 8);
					}
					grid[2*x][2*y] = char(v+'0');
				}
			}
		}

		array<int, 2> nxt_inds = {0, 0};
		vector<vector<int>> idx(N, vector<int>(M));
		auto special = [&](int x, int y) -> bool {
			assert(0 <= x && x < N);
			assert(0 <= y && y < M);
			char c = grid[2*x][2*y];
			return c == '2' || c == '4' || c == '7';
		};
		array<vector<array<int, 2>>, 2> coords;
		for (int x = 0; x < N; x++) {
			for (int y = 0; y < M; y++) {
				if (special(x, y)) {
					int parity = (x+y)%2;
					idx[x][y] = nxt_inds[parity]++;
					coords[parity].push_back({x, y});
				}
			}
		}

		/*
		   if (N >= 3) {
		   for (int x : {1, N-2}) {
		   for (int y : {1, M-2}) {
		   if (special(x, y)) my_ass();
		   }
		   }
		   }
		   */

		maroonrk::bipartitematching<int> bm(nxt_inds[0], nxt_inds[1]);

		auto is_border = [&](int x, int y) -> bool {
			return x == 0 || x == N-1 || y == 0 || y == M-1;
		};

		const vector<int> dx = {1, 0};
		const vector<int> dy = {0, 1};
		for (int x = 0; x < N; x++) {
			for (int y = 0; y < M; y++) {
				if (!special(x, y)) continue;
				int parity = (x+y)%2;
				for (int dir = 0; dir < 2; dir++) {
					int nx = x + dx[dir];
					int ny = y + dy[dir];
					if (nx < 0 || nx >= N || ny < 0 || ny >= M) continue;
					if (!special(nx, ny)) continue;
					int nparity = (nx+ny)%2;
					assert(parity != nparity);
					//if ((grid[2*x][2*y] < '7') != (grid[2*nx][2*ny] < '7')) continue;
					if (is_border(x, y) != is_border(nx, ny)) continue;
					if (N == 2 && nx-x == 1 && grid[2*x][2*y] == '4') continue;
					if (M == 2 && ny-y == 1 && grid[2*x][2*y] == '4') continue;
					if (parity == 0) {
						bm.ae(idx[x][y], idx[nx][ny]);
					} else if (nparity == 0) {
						bm.ae(idx[nx][ny], idx[x][y]);
					} else assert(false);
				}
			}
		}

		if (bm.n != bm.m) {
			my_ass();
			if (debug) continue;
			else break;
		}

		bm.calc();
		//cerr << "n=" << bm.n << endl;
		//cerr << "m=" << bm.m << endl;
		//cerr << "sz=" << bm.sz << endl;

		if (bm.n != bm.sz) {
			my_ass();
			if (debug) continue;
			else break;
		}

		for (int x = 0; x < 2*N-1; x++) {
			for (int y = 0; y < 2*M-1; y++) {
				if (grid[x][y] == '.') {
					grid[x][y] = '#';
				}
			}
		}
		for (int i = 0; i < bm.n; i++) {
			int j = bm.to[i];
			assert(j != -1);
			auto [x, y] = coords[0][i];
			auto [nx, ny] = coords[1][j];
			assert(idx[x][y] == i);
			assert(idx[nx][ny] == j);
			assert(abs(x - nx) + abs(y - ny) == 1);
			grid[x + nx][y + ny] = '.';
			//assert(((x + nx) != 1 && (x + nx) != 2*N-3) || (y + ny == 0 || y + ny == 2*M-2));
			//assert(((y + ny) != 1 && (y + ny) != 2*M-3) || (x + nx == 0 || x + nx == 2*N-2));
		}

		for (int x = 0; x < N; x++) {
			for (int y = 0; y < M; y++) {
				int cnt = 0;
				for (int diff_x : {-1, 0, 1}) {
					for (int diff_y : {-1, 0, 1}) {
						if (diff_x == 0 && diff_y == 0) continue;
						int nx = 2*x + diff_x;
						int ny = 2*y + diff_y;
						if (nx < 0 || nx >= 2*N-1) continue;
						if (ny < 0 || ny >= 2*M-1) continue;
						//assert(!isdigit(grid[nx][ny]));
						cnt += (grid[nx][ny] == '#');
					}
				}
				//assert(cnt == int(grid[2*x][2*y] - '0'));
			}
		}

		cout << "YES" << '\n';
		for (int x = 0; x < 2*N-1; x++) {
			cout << grid[x] << '\n';
		}
		cout << flush;

		for (int x : {1, 2*N-3}) {
			for (int y = 1; y+1 < 2*M-1; y++) assert(grid[x][y] == '#');
		}
		for (int y : {1, 2*M-3}) {
			for (int x = 1; x+1 < 2*N-1; x++) assert(grid[x][y] == '#');
		}
		//assert(N <= 3 && M <= 3);


		if (!debug) break;
	}
}