#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

const int mxn=1e3+5;
int n,m,x[mxn][mxn],u[mxn][mxn],l[mxn][mxn],r[mxn][mxn],d[mxn][mxn];
char a;

void push(int x, int y) {
	if (u[x][y]) {
		if (x+1==n) {
			cout<<"NO";
			exit(0);
		}
		swap(u[x][y],u[x+1][y]);
	}
	if (l[x][y]) {
		if (y+1==m) {
			cout<<"NO\n";
			exit(0);
		}
		swap(l[x][y],l[x][y+1]);
	}
	if (r[x][y]) {
		if (y-1==0) {
			cout<<"NO\n";
			exit(0);
		}
		swap(r[x][y],r[x][y-1]);
	}
	if (d[x][y]) {
		if (x-1==0) {
			cout<<"NO\n";
			exit(0);
		}
		swap(d[x][y],d[x-1][y]);
	}
}

bool ok(int x, int y) {
	int c = max(max(u[x][y],l[x][y]),max(r[x][y],d[x][y]));
	if (u[x][y] && u[x][y] != c) return 0;
	if (l[x][y] && l[x][y] != c) return 0;
	if (r[x][y] && r[x][y] != c) return 0;
	if (d[x][y] && d[x][y] != c) return 0;
	if (c && ::x[x][y]) return 0;
	if (l[x][y] && r[x][y] && l[x][y]!=r[x][y]) {
		cout<<"NO\n";
		exit(0);
	}
	if (u[x][y] && d[x][y] && u[x][y]!=d[x][y]) {
		cout<<"NO\n";
		exit(0);
	}
	
	
	return 1;
}

queue<int> qx,qy;

void p() {
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			int c = max(max(u[i][j],l[i][j]),max(r[i][j],d[i][j]));
			cout<<(char)(c+'.')<<"";
		}
		cout<<'\n';
	}
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>n>>m;
	cin>>a;
	for (int i=0; i<m; i++) {
		cin>>a; u[0][i] = a-'.';
	}
	cin>>a;
	for (int i=0; i<n; i++) {
		cin>>a;
		l[i][0] = a-'.';
		for (int j=0; j<m; j++) {
			cin>>a;
			x[i][j] = (a=='x');
			qx.push(i);
			qy.push(j);
		}
		cin>>a;
		r[i][m-1] = a-'.';
	}
	cin>>a;
	for (int i=0; i<m; i++) {
		cin>>a;
		d[n-1][i] = a-'.';
	}
	
	while (sz(qx)) {
		int x = qx.front(); qx.pop();
		int y = qy.front(); qy.pop();
		if (x<0 || x>=n || y<0 || y>=m) continue;
		if (ok(x,y)) continue;
		push(x,y);
		qx.push(x-1); qy.push(y);
		qx.push(x+1); qy.push(y);
		qx.push(x); qy.push(y+1);
		qx.push(x); qy.push(y-1);
	}
	cout<<"YES\n";
	p();
	
	
}