{"problem":{"name":"Grid Coloring","description":{"content":"We have a grid with $H$ rows and $W$ columns of squares. Snuke is painting these squares in colors $1$, $2$, $...$, $N$. Here, the following conditions should be satisfied: *   For each $i$ ($1 ≤ i ≤","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc080_b"},"statements":[{"statement_type":"Markdown","content":"We have a grid with $H$ rows and $W$ columns of squares. Snuke is painting these squares in colors $1$, $2$, $...$, $N$. Here, the following conditions should be satisfied:\n\n*   For each $i$ ($1 ≤ i ≤ N$), there are exactly $a_i$ squares painted in Color $i$. Here, $a_1 + a_2 + ... + a_N = H W$.\n*   For each $i$ ($1 ≤ i ≤ N$), the squares painted in Color $i$ are _4-connected_. That is, every square painted in Color $i$ can be reached from every square painted in Color $i$ by repeatedly traveling to a horizontally or vertically adjacent square painted in Color $i$.\n\nFind a way to paint the squares so that the conditions are satisfied. It can be shown that a solution always exists.\n\n## Constraints\n\n*   $1 ≤ H, W ≤ 100$\n*   $1 ≤ N ≤ H W$\n*   $a_i ≥ 1$\n*   $a_1 + a_2 + ... + a_N = H W$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$H$ $W$\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc080_b","tags":[],"sample_group":[["2 2\n3\n2 1 1","1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color $1$ are not 4-connected."],["3 5\n5\n1 2 3 4 5","1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3"],["1 1\n1\n1","1"]],"created_at":"2026-03-03 11:01:13"}}