#include <bits/stdc++.h>
using namespace std;
int dr[] = {-1, 0, 0, 1};
int dc[] = {0, -1, 1, 0};
int R, C;
char board[1004][1004];
int tid[1004][1004];
char dir[1004][1004];
char out[1004][1004];
int avail[1004][1004];
bool solve() {
  for (int r = (1), _b = (R); r <= _b; ++r) {
    for (int c = (1), _b = (C); c <= _b; ++c) {
      if (board[r][c] == 'w')
        tid[r][c] = -1;
      else if (board[r][c] == 'b')
        tid[r][c] = -2;
      if (tid[r][c] != 0) avail[r][c] = (1 << 4) - 1;
    }
  }
  int nt = 0;
  for (int r = (1), _b = (R); r <= _b; ++r) {
    for (int c = (1), _b = (C); c <= _b; ++c) {
      if (tid[r][c] != -2) continue;
      if (tid[r - 1][c] == -1) {
        if (tid[r + 1][c] != -1) return false;
        tid[r - 1][c] = tid[r][c] = tid[r + 1][c] = ++nt;
        dir[r - 1][c] = dir[r][c] = dir[r + 1][c] = 'V';
      } else {
        if (tid[r][c - 1] != -1 || tid[r][c + 1] != -1) return false;
        tid[r][c - 1] = tid[r][c] = tid[r][c + 1] = ++nt;
        dir[r][c - 1] = dir[r][c] = dir[r][c + 1] = 'H';
      }
    }
  }
  for (int r = (1), _b = (R); r <= _b; ++r) {
    for (int c = (1), _b = (C); c <= _b; ++c) {
      if (tid[r][c] < 0) {
        cerr << "Unasigned cell at (" << r << ',' << c << ")" << endl;
        return false;
      }
      if (tid[r][c] == 0) {
        assert(!out[r][c]);
        out[r][c] = '.';
      } else if (!out[r][c]) {
        int mask = (1 << 4) - 1;
        bool horiz = dir[r][c] == 'H';
        for (int i = 0, j = 0; i < 3 && j < 3;
             i += (horiz ? 0 : 1), j += (horiz ? 1 : 0))
          mask &= avail[r + i][c + j];
        if (mask == 0) {
          cerr << "No available color for cell at (" << r << ',' << c << ")"
               << endl;
          return false;
        }
        int col = (__builtin_ctz((mask)));
        for (int i = 0, j = 0; i < 3 && j < 3;
             i += (horiz ? 0 : 1), j += (horiz ? 1 : 0)) {
          out[r + i][c + j] = 'a' + col;
          for (int d = 0; d < 4; ++d) {
            int nr = r + i + dr[d], nc = c + j + dc[d];
            avail[nr][nc] &= ~(1 << col);
          }
        }
      }
    }
  }
  return true;
}
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> R >> C;
  for (int r = (1), _b = (R); r <= _b; ++r) cin >> (board[r] + 1);
  bool res = solve();
  if (!res)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (int r = (1), _b = (R); r <= _b; ++r) {
      for (int c = (1), _b = (C); c <= _b; ++c) cout << out[r][c];
      cout << '\n';
    }
  }
  return 0;
}
