For each test case, if no coloring exists, print a single word ``\t{No}'' on a separate line.

Otherwise, in the first line, print a single word ``\t{Yes}''.

In the second line, print six integers $a_b$, $a_l$, $a_k$, $a_f$, $a_r$, and $a_t$~--- the colors of the bottom, left, back, front, right, and top faces of the cube, respectively, in its initial position at cell $(1, 1)$ ($0 \le a_i < 2^{24}$).

If several possible colorings exist, print any of them.