Tiles

You have $n \cdot m$ square tiles, each painted with a color codified with a number. You will have to use the tiles to cover a floor of dimensions $n \times m$ , with just one restriction: there cannot be two or more (horizontal or vertical) adjacent tiles of the same color. Can you find a solution?

Input

Input consists of several cases, each with $n$ and $m$ , followed by $n \cdot m$ numbers, all between 1 and $n \cdot m$ . Assume $1 \le n \cdot m \le 10^5$ .

Output

For each case, if there is no solution, print a line with “NO”. Otherwise, print a line with “YES”, followed by $n$ lines with $m$ numbers each. If there is more than one solution, you can print any one. Follow strictly the format of the sample output.

Problem information

Author: Salvador Roura

Generation: 2026-01-25T11:56:42.604Z