#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int sum=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}
	while(isdigit(ch)){sum=sum*10+ch-48;ch=getchar();}
	return sum*f;
}
inline char gc()
{
	char ch=getchar();
	while(ch!='x'&&ch!='.'&&!isupper(ch)) ch=getchar();
	return ch;
}
char a[1005][1005];
char ans[1005][1005];
signed main()
{
	int n,m;
	n=read();m=read();
	for(int i=0;i<=n+1;i++)
		for(int j=0;j<=m+1;j++)
			a[i][j]=gc(),ans[i][j]='.';
	int i;
	for(i=1;i<=n;i++)
	{
		int L=m+2,R=-1;
		if(a[i][0]!='.')
		{
			for(int j=1;j<=m;j++)
			{
				if(a[i][j]=='x') continue;
				if(a[0][j]==a[i][0] || a[0][j]=='.')
				{
					L=j;
					break;
				}
			}
		}
		else L=0;
		if(a[i][m+1]!='.')
		{
			for(int j=m;j>=1;j--)
			{
				if(a[i][j]=='x') continue;
				if(a[0][j]==a[i][m+1] || a[0][j]=='.') 
				{
					R=j;
					break;
				}
			}
		}
		else R=m+1;
		
		if(L>R || (L==R && a[i][0]!=a[i][m+1]))
		{
			puts("NO");
			return 0;
		}
		
		
		
		if(a[i][0]!='.') ans[i][L]=a[i][0],a[0][L]='.';
		if(a[i][m+1]!='.') ans[i][R]=a[i][m+1],a[0][R]='.';
		
		for(int j=L+1;j<R;j++)
		{
			if(a[i][j]=='x') continue;
			if(a[0][j]!='.') ans[i][j]=a[0][j],a[0][j]='.';
			else ans[i][j]=a[n+1][j];
		}
		
		bool OK=1;
		for(int j=1;j<=m;j++) if(a[0][j]!='.'){OK=0;break;}
		if(OK) break;
	}
	
	int ti=i;
//	cout<<ti<<endl;
	
	
	for(int j=1;j<=m;j++) if(a[0][j]!='.') {puts("NO");return 0;}
	
	
	
	for(int i=n;i>ti;i--)
	{
		int L=m+2,R=-1;
		if(a[i][0]!='.')
		{
			for(int j=1;j<=m;j++)
			{
				if(a[i][j]=='x') continue;
				if(a[n+1][j]==a[i][0] || a[n+1][j]=='.')
				{
					L=j;
					break;
				}
			}
		}
		else L=0;
		if(a[i][m+1]!='.')
		{
			for(int j=m;j>=1;j--)
			{
				if(a[i][j]=='x') continue;
				if(a[n+1][j]==a[i][m+1] || a[n+1][j]=='.') 
				{
					R=j;
					break;
				}
			}
		}
		else R=m+1;
		
		if(L>R || (L==R && a[i][0]!=a[i][m+1]))
		{
			puts("NO");
			return 0;
		}
		
		
		
		if(a[i][0]!='.') ans[i][L]=a[i][0],a[n+1][L]='.';
		if(a[i][m+1]!='.') ans[i][R]=a[i][m+1],a[n+1][R]='.';
		
		for(int j=L+1;j<R;j++)
		{
			if(a[i][j]=='x') continue;
			if(a[n+1][j]!='.') ans[i][j]=a[n+1][j],a[n+1][j]='.';
			else ans[i][j]=a[n+1][j];
		}
	}
	
	for(int j=1;j<=m;j++)
	{
		if(a[n+1][j]=='.') continue;
		bool g=0;
		for(int i=n;i>=1;i--)
		{
			if(ans[i][j]=='.') continue;
			if(ans[i][j]==a[n+1][j])
			{
				g=1;
				break;
			}
			else break;
		}
		if(!g) {puts("NO");return 0;}
	}
	
	puts("YES");
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
			cout<<ans[i][j];
		cout<<endl;
	}
	return 0;
}