{"raw_statement":[{"iden":"problem statement","content":"We have a grid with $N \\times M$ squares. You will fill every square with an integer between $1$ and $25$ (inclusive). Let $a_{i,j}$ be the integer to be written in the square at the $i$\\-th row from the top and $j$\\-th column from the left.\nFind a way to fill the squares to satisfy the condition below. It can be proved that, under the Constraints of this problem, such a way always exists.\n\n*   For any integers $1\\leq x_1 < x_2\\leq N,1\\leq y_1 < y_2 \\leq M$, it must not be the case that $a_{x_1,y_1},a_{x_1,y_2},a_{x_2,y_1},a_{x_2,y_2}$ are all equal."},{"iden":"constraints","content":"*   $2 \\leq N , M \\leq 500$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$"},{"iden":"sample input 1","content":"2 3"},{"iden":"sample output 1","content":"1 1 1\n1 2 3\n\n$(x_1,x_2,y_1,y_2)$ can be one of $(1,2,1,2),(1,2,2,3),(1,2,1,3)$.\nFor any of them, the numbers written in the squares are not all equal, so this output satisfies the condition."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}