Mirko has just installed a brand new drawing program. The program supports \(K\) different colours, denoted by integers from \(1\) to \(K\). All drawing is performed on a canvas with dimensions \(N \times N\). In the beginning, all cells are white (denoted by \(1\)).

The upper-left cell of the canvas has coordinates \((0, 0)\). The first coordinate, \(x\), increases iterating over rows, and the second, \(y\), increases iterating over columns.

Mirko's favourite pastime is drawing rectangular checkerboard patterns using the command PAINT c x1 y1 x2 y2, where \(c\) denotes the chosen colour, and \((x_1, y_1)\) and \((x_2, y_2)\) are the coordinates of the upper-left and lower-right cells, respectively, of the rectangle being painted.

The upper-left cell of the rectangle will be painted in the chosen colour, while the rest are determined by the checkerboard pattern — a cell of the rectangle is painted with the chosen colour exactly when the sum of its row and column offsets from the upper-left corner is even. Cells that are not painted over by the chosen colour retain their previous colour.

Mirko has recently discovered two additional commands. He can save his painting at any time using the creatively named command SAVE, and load it again later using the command LOAD x, where \(x\) is a positive integer representing the ordinal number of the save.

The first line of input contains three positive integers, \(N\) (\(1 \le N \le 1000\)), \(K\) (\(2 \le K \le 100\,000\)), and \(M\) (\(1 \le M \le 100\,000\), the number of commands).

Each of the following \(M\) lines contains one of the three described commands. Input will not contain any illegal commands.

Output must consist of \(N\) lines, each containing \(N\) integers representing the colours of cells in the corresponding row of the painting.

riseoj 작성

출처 COCI 2010/2011 Contest 5