import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const K = readInt();
        const X = readLong();
        const Y = readLong();
        auto A = new long[K];
        foreach (i; 0 .. K) {
          A[i] = readLong();
        }
        auto P = new long[K];
        foreach (i; 0 .. K) {
          P[i] = readLong();
        }
        
        bool ans;
        if (X > Y) {
          ans = true;
        } else {
          // 0, ..., Y - X
          long sum;
          foreach (i; 0 .. K) {
            sum ^= A[i] % (P[i] + 1);
          }
          ans = (sum > Y - X);
        }
        writeln(ans ? "Z" : "C");
      }
    }
  } catch (EOFException e) {
  }
}