#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    T t = bigmod(p, e / 2, M);
    return (t * t) % M;
  }
  return (bigmod(p, e - 1, M) * p) % M;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T multimod(T a, T b, T m) {
  T ans = 0ll;
  a %= m, b %= m;
  while (b) {
    if (b & 1ll) ans = m - ans > a ? (ans + a) : (ans + a - m);
    b >>= 1ll;
    a = (m - a) > a ? a + a : a + a - m;
  }
  return (T)ans;
}
char mat[1009][1009];
int vis[1009][1009];
int color(int a, int b, int c, int d, int e, int f) {
  int ret = 0;
  ret = ret | a;
  ret = ret | b;
  ret = ret | c;
  ret = ret | d;
  ret = ret | e;
  ret = ret | f;
  for (int i = 1; i <= 4; i++) {
    if (!(ret & (1 << i))) return (0 | (1 << i));
  }
}
int main() {
  int k;
  int t;
  int num, cases = 1;
  int n, m;
  cin >> n >> m;
  int i, j;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      scanf(" %c", &mat[i][j]);
    }
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (mat[i][j] == 'w' && !vis[i][j]) {
        if (mat[i][j + 1] == 'b' && !vis[i][j + 1] && !vis[i][j + 2] &&
            mat[i][j + 2] == 'w') {
          int c = color(vis[i][j - 1], vis[i - 1][j], vis[i - 1][j + 1],
                        vis[i - 1][j + 2], vis[i][j + 3], 0);
          vis[i][j + 2] = vis[i][j + 1] = vis[i][j] = c;
        } else if (mat[i + 1][j] == 'b' && mat[i + 2][j] == 'w' &&
                   !vis[i + 1][j] && !vis[i + 2][j]) {
          int c = color(vis[i - 1][j], vis[i][j - 1], vis[i + 1][j - 1],
                        vis[i + 2][j - 1], vis[i][j + 1], vis[i + 1][j + 1]);
          vis[i][j] = vis[i + 1][j] = vis[i + 2][j] = c;
        }
      }
    }
  }
  bool ok = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (mat[i][j] == '.') continue;
      if (!vis[i][j]) {
        ok = 1;
      }
    }
  }
  if (ok)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        if (mat[i][j] == '.') {
          cout << '.';
        } else {
          for (k = 1; k <= 4; k++) {
            if ((vis[i][j] & (1 << k))) {
              cout << (char)(k - 1 + 'a');
              break;
            }
          }
        }
      }
      cout << endl;
    }
  }
  return 0;
}
