Alice, Bob and Charlie are bidding for an artifact at an auction.  
Alice bids A rupees, Bob bids B rupees, and Charlie bids C rupees (where A, B, and C are distinct). 

According to the rules of the auction, the person who bids the highest amount will win the auction.  
Determine who will win the auction.

------ Input Format ------ 

- The first line contains a single integer T — the number of test cases. Then the test cases follow.
- The first and only line of each test case contains three integers A, B, and C, — the amount bid by Alice, Bob, and Charlie respectively.

------ Output Format ------ 

For each test case, output who (out of Alice, Bob, and Charlie) will win the auction.

You may print each character of Alice, Bob, and Charlie in uppercase or lowercase (for example, ALICE, aliCe, aLIcE will be considered identical).

------ Constraints ------ 

$1 ≤ T ≤ 1000$
$1 ≤ A, B, C ≤ 1000$
$A$, $B$, and $C$ are distinct.

----- Sample Input 1 ------ 
4
200 100 400
155 1000 566
736 234 470
124 67 2

----- Sample Output 1 ------ 
Charlie
Bob
Alice
Alice

----- explanation 1 ------ 
Test Case $1$: Charlie wins the auction since he bid the highest amount.

Test Case $2$: Bob wins the auction since he bid the highest amount.

Test Case $3$: Alice wins the auction since she bid the highest amount.

Test Case $4$: Alice wins the auction since she bid the highest amount.

Difficulty: EASY

Solutions:
c = int(input())
for i in range(c):
	(a, b, c) = map(int, input().split(' '))
	if max(a, b, c) == a:
		print('Alice')
	elif max(a, b, c) == b:
		print('Bob')
	else:
		print('Charlie')


T = int(input())
for i in range(T):
	(x, y, z) = map(int, input().split())
	m = max(x, y, z)
	if m == x:
		print('Alice')
	elif m == y:
		print('Bob')
	else:
		print('Charlie')


T = int(input())
for i in range(T):
	(a, b, c) = map(int, input().split())
	hashm = {a: 'Alice', b: 'Bob', c: 'Charlie'}
	print(hashm[max(a, b, c)])


t = int(input())
for i in range(t):
	l = list(map(int, input().split()))
	if max(l) == l[0]:
		print('Alice')
	elif max(l) == l[1]:
		print('Bob')
	elif max(l) == l[2]:
		print('Charlie')


t = int(input())
for _ in range(t):
	(a, b, c) = input().split()
	(a, b, c) = (int(a), int(b), int(c))
	if a > b and a > c:
		print('Alice')
	elif b > a and b > c:
		print('Bob')
	else:
		print('Charlie')


n = int(input())
for i in range(n):
	(p, q, r) = map(int, input().split())
	if p > q and p > r:
		print('Alice')
	elif q > p and q > r:
		print('Bob')
	else:
		print('Charlie')


test = int(input())
ans = []
while test:
	test = test - 1
	(A, B, C) = [int(x) for x in input().split()]
	if A > B and A > C:
		ans.append('Alice')
	elif B > A and B > C:
		ans.append('Bob')
	else:
		ans.append('Charlie')
for i in ans:
	print(i)


t = int(input())
for _ in range(t):
	(A, B, C) = map(int, input().split())
	if A > B and A > C:
		print('Alice')
	elif B > C:
		print('Bob')
	else:
		print('Charlie')


for t in range(int(input())):
	(x, y, z) = map(int, input().split())
	if x > y and x > z:
		print('Alice')
	elif y > x and y > z:
		print('Bob')
	else:
		print('Charlie')


for i in range(int(input())):
	(a, b, c) = [int(i) for i in input().split()]
	if a > b and a > c:
		print('Alice')
	if b > c and b > a:
		print('Bob')
	if c > a and c > b:
		print('Charlie')


T = int(input())
for CRICKETER in range(T):
	(A, B, C) = map(int, input().split())
	if C > A and C > B:
		print('Charlie')
	elif A > B and A > C:
		print('Alice')
	else:
		print('Bob')


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	hmap = {a: 'Alice', b: 'Bob', c: 'Charlie'}
	print(hmap[max(a, b, c)])


T = int(input())
k = []
for i in range(T):
	(X, Y, Z) = map(int, input().split())
	k.append([X, Y, Z])
for i in range(len(k)):
	ind = k[i].index(max(k[i]))
	if ind == 0:
		print('Alice')
	elif ind == 1:
		print('Bob')
	else:
		print('Charlie')


T = int(input())
for i in range(T):
	(A, B, C) = map(int, input().split())
	max_bid = max(A, B, C)
	if max_bid == A:
		print('Alice')
	elif max_bid == B:
		print('Bob')
	else:
		print('Charlie')


for i in range(int(input())):
	app = list(map(int, input().split()))
	if app[1] > app[0] and app[1] > app[2]:
		print('Bob')
	elif app[0] > app[1] and app[0] > app[2]:
		print('Alice')
	else:
		print('Charlie')


n = int(input())
for i in range(n):
	m = input().split()
	if int(m[0]) > int(m[1]) and int(m[0]) > int(m[2]):
		print('Alice')
	elif int(m[2]) > int(m[0]) and int(m[2]) > int(m[1]):
		print('Charlie')
	else:
		print('Bob')


import math
n = int(input())
while n > 0:
	(a, b, c) = map(int, input().split())
	k = max(a, b, c)
	if k == a:
		print('Alice')
	if k == b:
		print('Bob')
	if k == c:
		print('Charlie')
	n -= 1


t = int(input())
for i in range(0, t):
	n = list(map(int, input().strip().split()))
	if n[0] > n[1] and n[0] > n[2]:
		print('Alice')
	elif n[1] > n[0] and n[1] > n[2]:
		print('Bob')
	else:
		print('Charlie')


t = int(input())
for i in range(t):
	(A, B, C) = map(int, input().split())
	D = max(A, B, C)
	if D == A:
		print('Alice')
	elif D == B:
		print('Bob')
	elif D == C:
		print('Charlie')


l = ['Alice', 'Bob', 'Charlie']
for _ in range(int(input())):
	(i, j, k) = map(int, input().split())
	p = [i, j, k]
	print(l[p.index(max(p))])


a = int(input())
for i in range(a):
	(z, x, c) = map(int, input().split())
	s = max(z, x, c)
	if s == z:
		print('Alice')
	elif s == x:
		print('Bob')
	else:
		print('Charlie')


cases = int(input())
for case in range(cases):
	(x, y, z) = map(int, input().split())
	if max(x, y, z) == x:
		print('Alice')
	elif max(x, y, z) == y:
		print('Bob')
	else:
		print('Charlie')