#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1000+5,M=N*4+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int flag[N][N];
int wax[4]={1,0,-1,0};
int way[4]={0,1,0,-1};
int op[N][N],n,m;
char s[N][N];
void walk(int x,int y,int opt,char s){
	if(x>n||y>m||x<1||y<1){gdb(x,y,opt,s);puts("NO");exit(0);}
	if(op[x][y]==-1){
		if(flag[x][y]=='.') walk(x+wax[opt],y+way[opt],opt,s);
		else if(flag[x][y]^s){puts("NO");exit(0);} 
		return; 
	}
	if(flag[x][y]=='.'){
		op[x][y]=opt;
		flag[x][y]=s;
		return;
	}
	if(s==flag[x][y]){
		op[x][y]=-1;return;
	}
	int ops=op[x][y];char c=flag[x][y];
	op[x][y]=-1;flag[x][y]='.';
	walk(x+wax[opt],y+way[opt],opt,s);
	walk(x+wax[ops],y+way[ops],ops,c);
}
void Solve(){
	scanf("%d%d",&n,&m);
	for(int i=0;i<=n+1;i++) scanf("%s",s[i]);
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) flag[i][j]='.';
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(s[i][j]=='x') op[i][j]=-1;
	for(int i=1;i<=m;i++) if(s[0][i]^'.') walk(1,i,0,s[0][i]);
	for(int i=1;i<=m;i++) if(s[n+1][i]^'.') walk(n,i,2,s[n+1][i]);
	for(int i=1;i<=n;i++) if(s[i][0]^'.') walk(i,1,1,s[i][0]);
	for(int i=1;i<=n;i++) if(s[i][m+1]^'.') walk(i,m,3,s[i][m+1]);
	puts("YES");
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++) printf("%c",flag[i][j]);
		printf("\n");
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}