We have a canvas represented as a $H \times W$ grid. Let $(i, j)$ denote the square at the $i$\-th row $(1 \leq i \leq H)$ from the top and $j$\-th column $(1 \leq j \leq W)$ from the left.
Initially, $(i, j)$ is in the following state.
* If $c_{i, j}=$`1`: painted in Color 1.
* If $c_{i, j}=$`2`: painted in Color 2.
* If $c_{i, j}=$`3`: painted in Color 3.
* If $c_{i, j}=$`4`: painted in Color 4.
* If $c_{i, j}=$`5`: painted in Color 5.
* If $c_{i, j}=$`.`: not yet painted.
Create a way to paint each unpainted square in Color 1, 2, 3, 4, or 5 so that no two horizontally or vertically adjacent squares have the same color. It is not allowed to change the color of a square that is already painted.
## Constraints
* $1 \leq H, W \leq 700$
* $c_{i, j}$ is `1`, `2`, `3`, `4`, `5`, or `.`.
* At least one square is unpainted.
* There is at least one way to paint the squares under the condition.
## Input
Input is given from Standard Input in the following format:
$H$ $W$
$c_{1, 1}$$c_{1, 2}$$\ldots$$c_{1, W}$
$c_{2, 1}$$c_{2, 2}$$\ldots$$c_{2, W}$
$:$
$c_{H, 1}$$c_{H, 2}$$\ldots$$c_{H, W}$
[samples]