In discus throw, a player is given 3 throws and the throw with the longest distance is regarded as their final score.

You are given the distances for all 3 throws of a player. Determine the final score of the player.

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

- First line will contain T, number of test cases. Then the test cases follow.
- Each test case contains of a single line of input, three integers A, B, and C denoting the distances in each throw.

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

For each test case, output the final score of the player.

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

$1 ≤ T ≤ 100$
$1 ≤ A,B,C ≤ 100$

----- Sample Input 1 ------ 
3
10 15 8
32 32 32
82 45 54

----- Sample Output 1 ------ 
15
32
82

----- explanation 1 ------ 
Test Case $1$: The longest distance is achieved in the second throw, which is equal to $15$ units. Thus, the answer is $15$.

Test Case $2$: In all throws, the distance is $32$ units. Thus, the final score is $32$.

Test Case $3$: The longest distance is achieved in the first throw which is equal to $82$ units. Thus, the answer is $82$.

Difficulty: EASY

Starter code:

Solutions:
for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	max = 0
	for j in range(3):
		if a > max:
			max = a
		if b > max:
			max = b
		if c > max:
			max = c
	print(max)


t = int(input())
for i in range(t):
	(x, y, z) = map(int, input().split())
	print(max(x, y, z))


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	print(max(a, b, c))


for i in range(int(input())):
	x = list(map(int, input().split()))
	print(max(x))


t = int(input())
for tc in range(t):
	(a, b, c) = map(int, input().split())
	if a >= b and a >= c:
		print(a)
	elif b >= a and b >= c:
		print(b)
	elif c > a and c > b:
		print(c)


for i in range(0, int(input())):
	a = list(map(int, input().split()))
	print(max(a))


t = int(input())
while t > 0:
	throws = list(map(int, input().split()))
	print(max(throws))
	t -= 1


t = int(input())
for u in range(t):
	(A, B, C) = list(map(int, input().split()))
	print(max(A, B, C))


T = int(input())
for t in range(T):
	(A, B, C) = map(int, input().split())
	print(max(A, B, C))


for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	s = [a, b, c]
	s.sort()
	print(s[2])


N = int(input())
for i in range(N):
	l1 = list(map(int, input().split()))
	print(max(l1))


t = int(input())
for i in range(t):
	print(max(map(int, input().split())))


n = int(input())
while n > 0:
	a = list(map(int, input().split()))
	print(max(a))
	n -= 1


for T in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a >= b and a >= c:
		print(a)
	elif b >= a and b >= c:
		print(b)
	elif c >= a and c >= b:
		print(c)


for _ in range(int(input())):
	x = list(map(int, input().split()))
	print(max(x))


for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a >= b and a >= c:
		print(a)
	elif b >= a and b >= c:
		print(b)
	else:
		print(c)


t = int(input())
for i in range(0, t):
	(a, b, c) = map(int, input().split(' '))
	if a >= b and a >= c:
		print(a)
	elif b >= a and b >= c:
		print(b)
	else:
		print(c)


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


t = int(input())
for i in range(0, t):
	distance = list(map(int, input().split()))
	print(max(distance))


n = int(input())
for n in range(0, n):
	lst = list(map(int, input().split()))
	print(max(lst))


for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a > b:
		if a > c:
			print(a)
		else:
			print(c)
	elif b > c:
		print(b)
	else:
		print(c)


t = int(input())
for i in range(t):
	l = list(input().split())
	l = map(int, l)
	print(max(l))


n = int(input())
for i in range(0, n):
	(a, b, c) = map(int, input().split())
	sum = max(a, b, c)
	print(sum)


T = int(input())
for i in range(T):
	(X, Y, Z) = map(int, input().split())
	print(max(X, Y, Z))


t = int(input(''))
counter = 0
if 1 <= t <= 100:
	while counter < t:
		n = input('')
		n = n.split()
		n = [eval(i) for i in n]
		if 1 <= n[0] <= 100 and 1 <= n[1] <= 100 and (1 <= n[2] <= 100):
			maxvalue = max(n)
			print(maxvalue)
			counter += 1


for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	print(max(a, b, c))


t = int(input())
while t > 0:
	l = map(int, input().split())
	print(max(l))
	t -= 1


for i in range(0, int(input())):
	n = input().split()
	for i in range(0, len(n)):
		n[i] = int(n[i])
	print(max(n))


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


t = int(input())
for i in range(t):
	(m, n, o) = map(int, input().split())
	print(max(m, n, o))


n = int(input())
for i in range(n):
	(a, b, c) = map(int, input().split())
	s = max(a, b, c)
	print(s)


a = int(input())
for s in range(a):
	(a, b, c) = map(int, input().split())
	if a >= b >= c or a >= c >= b:
		print(a)
	elif b >= a >= c or b >= c >= a:
		print(b)
	elif c >= b >= a or c >= a >= b:
		print(c)


for i in range(int(input())):
	print(max([int(x) for x in input().split()]))


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	l = [a, b, c]
	l.sort()
	print(l[2])


T = int(input())
for i in range(T):
	(A, B, C) = map(int, input().split())
	if A <= B >= C:
		print(B)
	elif B <= A >= C:
		print(A)
	elif A <= C >= B:
		print(C)


Q = int(input())
for i in range(Q):
	(x, y, c) = map(int, input().split())
	print(max(x, y, c))


for i in range(int(input())):
	lst = list(map(int, input().split()))
	print(max(lst))


t = int(input())
while t > 0:
	(a, b, c) = map(int, input().split())
	print(max(a, b, c))
	t -= 1


t = int(input())
for i in range(t):
	x = list(map(int, input().split()))
	x.sort()
	print(x[2])


t = int(input())
for i in range(t):
	(n, x, y) = map(int, input().split())
	if x >= n and x >= y:
		print(x)
	elif n >= x and n >= y:
		print(n)
	elif y >= x and y >= n:
		print(y)