The russian intelligence agency KGB make an encryption technique to send their passwords. Originally the password is of 3 characters. After encryption the password is converted into 3 numbers A-B-C.

Now, Sherlock wants to decrypt the password encryption technique of KGB. Sherlock knows that every number has only 2 possible values which are following:

POSSIBLE VALUES OF "A": K, X

POSSIBLE VALUES OF "B": G, Y

POSSIBLE VALUES OF "C": B, Z

Help Sherlock to detect the encryption technique of the KGB and tell him the original password. [See problem explanation for further clarifiaction]

INPUT:

The first line consist number of test cases T followed by T lines, each line consist of 3 space separated integers A, B, C.

OUTPUT

Print the correct message in format of C-C-C

Constraints:

1 <= T <= 50000

1 <= A, B, C <= 1000000000