Triomino#2150
Tile an m \times n rectangular grid with triomino figures as shown in the picture. The figures can be rotated by multiples of 90^\circ, but overlapping pieces is not allowed. It is not always possible to fully tile an m \times n rectangle, but the number of uncovered cells can be minimized.
Write a program to find one possible tiling of the m \times n rectangle with triomino figures that minimizes the number of uncovered cells.
Two integers and (1 \le m \le 100, 1 \le n \le 100), the number of rows and columns of the rectangle.
Print lines each containing numbers. Each number denotes the label of the triomino covering the cell. If a cell is not covered by any figure, output for that cell. Figures should be numbered with distinct values , , , , (where is the total number of figures used).
There may be multiple valid answers for the same input. Output any of them.
Example 1