{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eWhen Cuber QQ was chatting happily in a QQ group one day, he accidentally noticed that there was a counterfeit of him, who stole his avatar and mimicked his tone, and more excessively, had a nickname \"Quber CC\", which was sarcastic to him. So Cuber QQ decided to play a little game with this Quber CC, and their bet was, whoever lost the game would have to do something really humiliating in front of everyone in the QQ group.\u003cbr\u003e\u003cbr\u003eThe game is like this. It\u0027s a traditional card game. Cuber QQ will play first. Cuber QQ, and his opponent (Quber CC of course), will each possess a hand of cards. There is no number (or rank if you prefer) on the card, but only color (or suit if you prefer). The players play cards alternatively, each player can only play one card in each turn. An additional rule is that, a player must \u003cb\u003enot\u003c/b\u003e play a card with the same color as any card which has been played by his/her opponent, but coincidence with a card played by himself/herself is acceptable.\u003cbr\u003e\u003cbr\u003eThe player who can\u0027t play any card loses. This might due to the fact that he/she has cards but he cannot play any due to the game rules, or he doesn\u0027t have any cards any more. As a game played between civilized people, the game will be played in a completely transparent manner, where Cuber QQ and Quber CC know exactly what\u0027s left in their opponent\u0027s hand.\u003cbr\u003e\u003cbr\u003eIt\u0027s now a game attracting thousands of eyes, and you decided to invent a predictor whose job is to predict \"who will win if both players play smart\" to excite the audience.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input is a positive integer $t$, denoting the number of test cases.\u003cbr\u003e\u003cbr\u003eThen follows $t$ test cases, each test case starts with space-separated integers $n$, $m$, $p$ ($1 \\le n, m \\le 10^5$, $p \\in \\{1, 2\\}$). Generally speaking, this should be followed by two lines of integers $a_1, a_2, \\ldots, a_n$ and $b_1, b_2, \\ldots, b_m$, denoting the colors of Cuber QQ\u0027s hand and Quber CC\u0027s hand, respectively. Unfortunately, as it turns out, the input will be the bottleneck in that case. So we introduce $p$ to deal with this problem.\u003cbr\u003e\u003cbr\u003eFor $p \u003d 1$, there follows two lines, where the first line is $a_1, a_2, \\ldots, a_n$ and the second line is $b_1, b_2, \\ldots, b_m$, all space separated and $0 \\le a_i, b_i \u0026lt; 10^9$.\u003cbr\u003e\u003cbr\u003eFor $p \u003d 2$, there follows two lines, which are $k_1, k_2, mod$ ($0 \\le k_1, k_2 \u0026lt; 2^{64}$, $1 \\le mod \\le 10^9$) to generate $\\{a_i\\}$ and $\\{b_i\\}$, respectively.\u003cbr\u003e\u003cbr\u003eHere are some instructions on how to generate $\\{a_i\\}$, $\\{b_i\\}$ with $k_1, k_2, mod$, which you\u0027ve probably seen before, somehow:\u003cbr\u003e\u003cbr\u003e\u003cpre\u003e\u003cbr\u003eunsigned long long k1, k2;\u003cbr\u003eunsigned long long rng() {\u003cbr\u003e unsigned long long k3 \u003d k1, k4 \u003d k2;\u003cbr\u003e k1 \u003d k4;\u003cbr\u003e k3 ^\u003d k3 \u0026lt;\u0026lt; 23;\u003cbr\u003e k2 \u003d k3 ^ k4 ^ (k3 \u0026gt;\u0026gt; 17) ^ (k4 \u0026gt;\u0026gt; 26);\u003cbr\u003e return k2 + k4;\u003cbr\u003e}\u003cbr\u003e\u003cbr\u003e// generate\u003cbr\u003eread(k1, k2, mod);\u003cbr\u003efor (int i \u003d 0; i \u0026lt; n; ++i)\u003cbr\u003e a[i] \u003d rng() % mod;\u003cbr\u003e\u003cbr\u003eread(k1, k2, mod);\u003cbr\u003efor (int i \u003d 0; i \u0026lt; m; ++i)\u003cbr\u003e b[i] \u003d rng() % mod;\u003cbr\u003e\u003c/pre\u003e\u003cbr\u003e\u003cbr\u003eAlso, the sum of $n+m$ for $p\u003d1$ does not exceed $5 \\cdot 10^5$; the sum of $n+m$ from all test cases does not exceed $10^7$.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, predict the winner: \"Cuber QQ\" or \"Quber CC\"."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n6 7 1\r\n1 1 4 5 1 4\r\n1 9 1 9 8 1 0\r\n10 20 2\r\n1 2 10\r\n1 2 10\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCuber QQ\r\nQuber CC\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}