{"problem":{"name":"Not Equal Rectangle","description":{"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc140_e"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $2 \\leq N , M \\leq 500$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc140_e","tags":[],"sample_group":[["2 3","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."]],"created_at":"2026-03-03 11:01:13"}}