L. Carrot Fantasy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Master Yi is a farmer. He has a large farm with many radishes planted in it. Recently, he lost some due to the stealing of wild rabbits. He thus decided to place some fences to protect all his carrots.

The farm is a rectangle consisting of $$$R\times C$$$ cells. Each cell is either empty, contains a carrot, a rabbit or a fence. Rabbits can roam freely around the farm, by repeatedly moving to the left, right, up or down to a neighboring cell. When a rabbit enters a cell with a carrot, it consumes it. However, no rabbit can enter a cell with a fence.

Initially there are no fences. Place fences onto the farm in such a way that no rabbit can reach any carrot, or determine that it is impossible. Note that since you have many fences, you do not need to minimize their number.

Input

First line contains two integers $$$R\ (1\le R\le 500)$$$ and $$$C\ (1\le C\le 500)$$$, denoting the number of rows and the numbers of columns respectively.

Each of the following $$$R$$$ lines is a string consisting of exactly $$$C$$$ characters, representing one row of the pasture. Here, C means a carrot, R is a rabbit and . an empty cell.

Output

If it is impossible to protect all carrots, output a single line with the word No.

Otherwise, output a line with the word Yes. Then print $$$R$$$ lines, representing the farm after placing fences. Again, C means a carrot, R is a rabbit, # is a fence and . an empty cell. You are not allowed to move, remove or add a carrot or a rabbit.

Example
Input
5 5
....R
C..R.
CC..R
.....
.R.CC
Output
Yes
..#.R
C.#R.
CC#.R
#####
.R#CC