#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("YES");}
#define no { puts("NO"); exit(0);}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define yn {puts("Yes");}else{puts("No");}
template<typename T>void rot(T& a,int i){rotate(a.begin(),a.begin()+(i),a.end());}
template<typename T>void rot(vv<T>& a){int h=sz(a),w=sz(a[0]);vv<T> p(w,vc<T>(h));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];}
void rot(vc<string>& a){int h=sz(a),w=sz(a[0]);vc<string> p(w,string(h,'?'));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];}
using vs = vc<string>;
void vin(vs& s){int n,m;cin>>n>>m;s=vs(n);cin>>s;}

struct Solver {
  void solve() {
    int h,w;
    scanf("%d%d",&h,&w);
    vs s(h+2);
    cin>>s;

    queue<P> q;
    vi li(h+2,1), ri(h+2,w);
    vi lj(w+2,1), rj(w+2,h);
    auto adli = [&](int i) {
      int& j = li[i];
      while (j <= w && s[i][j] == 'x') j++;
      if (j > w) no;
      if (s[i][j] != '.' && s[i][j] != s[i][0]) {
        s[i][j] = 'x';
        q.em(i,j);
      } else s[i][j] = s[i][0];
    };
    auto adri = [&](int i) {
      int& j = ri[i];
      while (j >= 1 && s[i][j] == 'x') j--;
      if (j < 1) no;
      if (s[i][j] != '.' && s[i][j] != s[i][w+1]) {
        s[i][j] = 'x';
        q.em(i,j);
      } else s[i][j] = s[i][w+1];
    };
    auto adlj = [&](int j) {
      int& i = lj[j];
      while (i <= h && s[i][j] == 'x') i++;
      if (i > h) no;
      if (s[i][j] != '.' && s[i][j] != s[0][j]) {
        s[i][j] = 'x';
        q.em(i,j);
      } else s[i][j] = s[0][j];
    };
    auto adrj = [&](int j) {
      int& i = rj[j];
      while (i >= 1 && s[i][j] == 'x') i--;
      if (i < 1) no;
      if (s[i][j] != '.' && s[i][j] != s[h+1][j]) {
        s[i][j] = 'x';
        q.em(i,j);
      } else s[i][j] = s[h+1][j];
    };

    rep1(i,h) {
      if (s[i][0] == '.') li[i] = INF; else adli(i);
      if (s[i][w+1] == '.') ri[i] = INF; else adri(i);
    }
    rep1(j,w) {
      if (s[0][j] == '.') lj[j] = INF; else adlj(j);
      if (s[h+1][j] == '.') rj[j] = INF; else adrj(j);
    }

    while (sz(q)) {
      // rep(k,h+2) cout<<s[k]<<endl;
      auto [i,j] = q.front(); q.pop();
      if (li[i] == j) adli(i);
      if (ri[i] == j) adri(i);
      if (lj[j] == i) adlj(j);
      if (rj[j] == i) adrj(j);
    }

    yes;
    rep1(i,h) {
      rep1(j,w) if (s[i][j] == 'x') s[i][j] = '.';
      cout<<s[i].substr(1,w)<<endl;
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}