There are 3 problems in a contest namely A, B, C respectively. Alice bets Bob that problem C is the hardest while Bob says that problem B will be the hardest. 

You are given three integers S_{A}, S_{B}, S_{C} which denotes the number of successful submissions of the problems A, B, C respectively. It is guaranteed that each problem has a different number of submissions. Determine who wins the bet.

1) If Alice wins the bet (i.e. problem C is the hardest), then output Alice.

2) If Bob wins the bet (i.e. problem B is the hardest), then output Bob.

3) If no one wins the bet (i.e. problem A is the hardest), then output Draw.

Note: The hardest problem is the problem with the least number of successful submissions.

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

- The first line of input contains a single integer T denoting the number of test cases. The description of T test cases follows.
- The first and only line of each test case contains three space-separated integers S_{A}, S_{B}, S_{C}, denoting the number of successful submissions of problems A, B, C respectively. 

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

For each test case, output the winner of the bet or print Draw in case no one wins the bet.

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

$1 ≤ T ≤ 100$
$1 ≤ S_{A},S_{B},S_{C} ≤ 100$
$S_{A}, S_{B}, S_{C}$ are all distinct.

------ subtasks ------ 

TESTING

----- Sample Input 1 ------ 
3
1 4 2
16 8 10
14 15 9

----- Sample Output 1 ------ 
Draw
Bob
Alice

----- explanation 1 ------ 
Test case $1$:  Problem $A$ turns out to be the hardest so no one wins the bet.

Test case $2$:  Problem $B$ turns out to be the hardest so Bob wins the bet.

Test case $3$:  Problem $C$ turns out to be the hardest so Alice wins the bet.

Source: codechef | Difficulty: EASY
Tags: Complete search

Ad-hoc


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


n = int(input())
for i in range(1, n + 1):
	(a, b, c) = list(map(int, input().split()))
	x = min(a, b, c)
	if x == a:
		print('Draw')
	elif x == b:
		print('Bob')
	else:
		print('Alice')


for i in range(int(input())):
	(sa, sb, sc) = map(int, input().split())
	if sa < sb and sa < sc:
		print('Draw')
	elif sb < sa and sb < sc:
		print('Bob')
	else:
		print('Alice')


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


for i in range(int(input())):
	a = list(map(int, input().split()))
	p = min(a)
	if p is a[0]:
		print('Draw')
	elif p is a[1]:
		print('Bob')
	else:
		print('Alice')


t = int(input())
for i in range(t):
	a = list(map(int, input().split()))
	c = min(a)
	if a[0] == c:
		print('Draw')
	elif a[1] == c:
		print('Bob')
	else:
		print('Alice')


for t in range(int(input())):
	a = list(map(int, input().split()))
	b = min(a)
	if a[1] == b:
		print('Bob')
	elif a[2] == b:
		print('Alice')
	else:
		print('Draw')


t = int(input())
for _ in range(t):
	(sa, sb, sc) = map(int, input().split())
	minimum = min(sa, sb, sc)
	if minimum == sa:
		print('Draw')
	elif minimum == sb:
		print('Bob')
	else:
		print('Alice')


for _ in range(int(input())):
	sub = list(map(int, input().split()))
	har = min(sub)
	if har is sub[2]:
		print('Alice')
	elif har is sub[1]:
		print('Bob')
	else:
		print('Draw')


for _ in range(int(input())):
	submissions = list(map(int, input().split()))
	hardest = min(submissions)
	if hardest is submissions[2]:
		print('Alice')
	elif hardest is submissions[1]:
		print('Bob')
	else:
		print('Draw')


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	d = min(a, b, c)
	if d == a:
		print('Draw')
	elif d == b:
		print('Bob')
	else:
		print('Alice')


for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	if min(a, b, c) == c:
		print('Alice')
	elif min(a, b, c) == b:
		print('Bob')
	else:
		print('Draw')


t = int(input())
for i in range(t):
	(sa, sb, sc) = map(int, input().split())
	out = min(sa, sb, sc)
	if out == sc:
		print('Alice')
	elif out == sb:
		print('Bob')
	else:
		print('Draw')


T = int(input())
for i in range(T):
	(A, B, C) = [int(i) for i in input().split(' ')]
	if min(A, B, C) == A:
		print('Draw')
	elif min(A, B, C) == B:
		print('Bob')
	else:
		print('Alice')


t = int(input())
for i in range(t):
	A = list(map(int, input().split()))
	hardest = min(A)
	if hardest == A[0]:
		print('Draw')
	elif hardest == A[1]:
		print('Bob')
	else:
		print('Alice')


t = int(input())
for i in range(t):
	(s1, s2, s3) = map(int, input().split())
	if s1 < s2 and s1 < s3:
		print('Draw')
	elif s2 < s1 and s2 < s3:
		print('Bob')
	elif s3 < s2 and s3 < s1:
		print('Alice')


t = int(input())
i = 1
while i <= t:
	i += 1
	(a, b, c) = map(int, input().split())
	if a > b > c or b > a > c:
		print('Alice')
	elif c > a > b or a > c > b:
		print('Bob')
	else:
		print('Draw')


n = int(input())
for _ in range(n):
	(A, B, C) = list(map(int, input().split()))
	if min(A, B, C) == A:
		print('Draw')
	elif min(A, B, C) == B:
		print('Bob')
	elif min(A, B, C) == C:
		print('Alice')


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


for item in range(int(input())):
	(sA, sB, sC) = map(int, input().split())
	hardest = min(sA, sB, sC)
	if hardest == sC:
		print('Alice')
	elif hardest == sB:
		print('Bob')
	else:
		print('Draw')


t = int(input())
for i in range(t):
	l = list(map(int, input().split()))
	x = l.index(min(l))
	if x == 0:
		print('Draw')
	elif x == 1:
		print('Bob')
	else:
		print('Alice')


for i in range(int(input())):
	(a, b, c) = map(int, input().split(' '))
	k = {a: 'Draw', b: 'Bob', c: 'Alice'}
	print(k[min(min(a, b), c)])


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


t = int(input())
for i in range(t):
	(s1, s2, s3) = map(int, input().split())
	s = min(min(s1, s2), s3)
	if s == s3:
		print('Alice')
	elif s == s2:
		print('Bob')
	else:
		print('Draw')


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


T = int(input())
for i in range(T):
	(SA, SB, SC) = map(int, input().split())
	if SA < SB and SA < SC:
		print('Draw')
	elif SB < SC:
		print('Bob')
	else:
		print('Alice')