Problem: There are many interesting tasks on domino tilings. For example, an interesting fact is known. Let us take a standard chessboard (8 × 8) and cut exactly two squares out of it. It turns out that the resulting board can always be tiled using dominoes 1 × 2, if the two cut out squares are of the same color, otherwise it is impossible. 

Petya grew bored with dominoes, that's why he took a chessboard (not necessarily 8 × 8), cut some squares out of it and tries to tile it using triminoes. Triminoes are reactangles 1 × 3 (or 3 × 1, because triminoes can be rotated freely), also the two extreme squares of a trimino are necessarily white and the square in the middle is black. The triminoes are allowed to put on the chessboard so that their squares matched the colors of the uncut squares of the chessboard, and also the colors must match: the black squares must be matched with the black ones only and the white ones — with the white squares. The triminoes must not protrude above the chessboard or overlap each other. All the uncut squares of the board must be covered with triminoes. 

Help Petya find out if it is possible to tile his board using triminos in the described way and print one of the variants of tiling.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000) — the board size. Next n lines contain m symbols each and represent the board description. If some position contains ".", then the square in this position has been cut out. Symbol "w" stands for a white square, "b" stands for a black square. It is guaranteed that through adding the cut squares can result in a correct chessboard (i.e. with alternating black and white squares), thought, perhaps, of a non-standard size.

Output

If at least one correct tiling exists, in the first line print "YES" (without quotes), and then — the tiling description. The description must contain n lines, m symbols in each. The cut out squares, as well as in the input data, are marked by ".". To denote triminoes symbols "a", "b", "c", "d" can be used, and all the three squares of each trimino must be denoted by the same symbol. If two triminoes share a side, than they must be denoted by different symbols. Two triminoes not sharing a common side can be denoted by one and the same symbol (c.f. sample).

If there are multiple correct ways of tiling, it is allowed to print any. If it is impossible to tile the board using triminoes or the correct tiling, for which four symbols "a", "b", "c", "d" would be enough, doesn't exist, print "NO" (without quotes) in the first line.

Examples

Input

6 10
.w.wbw.wbw
wbwbw.w.w.
bw.wbwbwbw
w.wbw.wbwb
...wbw.w.w
..wbw.wbw.


Output

YES
.a.aaa.ccc
baccc.c.a.
ba.dddcbab
b.aaa.cbab
...bbb.b.b
..ccc.ddd.

Input

2 2
wb
bw


Output

NO


Input

1 3
wbw


Output

YES
bbb


Input

1 3
...


Output

YES
...

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int m, n, j, k, l, i, o, p, __t;
char ch;
void read(int &a) {
  for (ch = getchar(); (ch < '0' || ch > '9') && (ch != '-'); ch = getchar())
    ;
  if (ch == '-')
    a = 0, __t = -1;
  else
    a = ch - '0', __t = 1;
  for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
    a = a * 10 + ch - '0';
  a *= __t;
}
string S[2000];
char ans[2000][2000];
bool exist[2000][2000];
int Go[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
void cover(int x, int y, int addx, int addy) {
  bool could[4] = {1, 1, 1, 1};
  for (int i = 0; i < 3; i++) {
    int X = x + addx * i;
    int Y = y + addy * i;
    for (int j = 0; j < 4; j++) {
      int nx = X + Go[j][0];
      int ny = Y + Go[j][1];
      if (nx < 1 || ny < 1 || nx > m || ny > n || ans[nx][ny] == '.') continue;
      could[ans[nx][ny] - 'a'] = 0;
    }
  }
  for (int i = 0; i < 4; i++)
    if (could[i]) {
      ch = 'a' + i;
      break;
    }
  for (int i = 0; i < 3; i++) {
    ans[x + addx * i][y + addy * i] = ch;
    exist[x + addx * i][y + addy * i] = 1;
  }
}
int main() {
  read(m), read(n);
  for (int i = 1; i <= m; i++) {
    cin >> S[i];
    S[i] = " " + S[i];
  }
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++) ans[i][j] = '.';
  bool could = 1;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      if (S[i][j] == 'w' && exist[i][j] == 0) {
        bool can = 1;
        if (j + 2 > n) can = 0;
        if (can && (S[i][j + 1] != 'b' || S[i][j + 2] != 'w' ||
                    exist[i][j + 1] || exist[i][j + 2]))
          can = 0;
        if (can) {
          cover(i, j, 0, 1);
          continue;
        }
        if (i + 2 > m) {
          could = 0;
          continue;
        }
        if (S[i + 1][j] != 'b' || S[i + 2][j] != 'w') {
          could = 0;
          continue;
        }
        cover(i, j, 1, 0);
      }
  if (!could)
    printf("NO\n");
  else
    printf("YES\n");
  if (could) {
    for (int i = 1; i <= m; i++, printf("\n"))
      for (int j = 1; j <= n; j++) printf("%c", ans[i][j]);
  }
}