Infinite RGB Tiling

There are infinitely many red, green, and blue dominoes, and one red unit square. A domino covers two unit cells sharing a side. These pieces cover every cell of an infinite integer-coordinate grid without overlap. The $x$-coordinate increases to the right, and the $y$-coordinate increases upward.

Cover $(0,0)$ with the red unit square. The domino positions are fixed as follows. For every integer $r\geq1$ and every integer $0\leq k<r$, cover each of the following pairs of cells with one domino.

• $(-r+2k,r)$, $(-r+2k+1,r)$.
• $$, .

The domino covering $(-1,1)$ and $(0,1)$ is green. Whenever two distinct pieces share a boundary segment of positive length, they must have different colors. Meeting at a single point imposes no restriction. A coloring satisfying these conditions exists and is unique.

The part with $-4\leq x,y\leq4$ is shown below. The top row has $y=4$, and each row is shown from left to right. $\tt{R}$, $\tt{G}$, and denote red, green, and blue, respectively.

GGBBRRGGB
BRRGGBBRB
BGBBRRGRG
RGRGGBGBG
RBRBRBRBR
GBGBGGRGR
GRGRRBBGB
BRBBGGRRB
BGGRRBBGG

Given integers $x_{\min},y_{\min},x_{\max},y_{\max}$, print the color pattern in the inclusive rectangle , .

The first line contains the number of test cases $T$. The input format is:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print $y_{\max}-y_{\min}+1$ lines, in the order $$. On each line, print the colors , , or for , without spaces. Do not print blank lines between cases.

• $1\leq T\leq100\,000$.
• $-10^{18}\leq x_{\min}\leq x_{\max}\leq10^{18}$.