{"raw_statement":[{"iden":"problem statement","content":"We have a grid with $H$ rows and $W$ columns of squares. We will represent the square at the $i$\\-th row from the top and $j$\\-th column from the left as $(i,\\ j)$. Also, we will define the distance between the squares $(i_1,\\ j_1)$ and $(i_2,\\ j_2)$ as $|i_1 - i_2| + |j_1 - j_2|$.\nSnuke is painting each square in red, yellow, green or blue. Here, for a given positive integer $d$, he wants to satisfy the following condition:\n\n*   No two squares with distance exactly $d$ have the same color.\n\nFind a way to paint the squares satisfying the condition. It can be shown that a solution always exists."},{"iden":"constraints","content":"*   $2 ≤ H, W ≤ 500$\n*   $1 ≤ d ≤ H + W - 2$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$ $W$ $d$"},{"iden":"sample input 1","content":"2 2 1"},{"iden":"sample output 1","content":"RY\nGR\n\nThere are four pairs of squares with distance exactly $1$. As shown below, no two such squares have the same color.\n\n*   $(1,\\ 1)$, $(1,\\ 2)$ : `R`, `Y`\n*   $(1,\\ 2)$, $(2,\\ 2)$ : `Y`, `R`\n*   $(2,\\ 2)$, $(2,\\ 1)$ : `R`, `G`\n*   $(2,\\ 1)$, $(1,\\ 1)$ : `G`, `R`"},{"iden":"sample input 2","content":"2 3 2"},{"iden":"sample output 2","content":"RYB\nRGB\n\nThere are six pairs of squares with distance exactly $2$. As shown below, no two such squares have the same color.\n\n*   $(1,\\ 1)$ , $(1,\\ 3)$ : `R` , `B`\n*   $(1,\\ 3)$ , $(2,\\ 2)$ : `B` , `G`\n*   $(2,\\ 2)$ , $(1,\\ 1)$ : `G` , `R`\n*   $(2,\\ 1)$ , $(2,\\ 3)$ : `R` , `B`\n*   $(2,\\ 3)$ , $(1,\\ 2)$ : `B` , `Y`\n*   $(1,\\ 2)$ , $(2,\\ 1)$ : `Y` , `R`"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}