Three numbers A, B and C are the inputs. Write a program to find second largest among three numbers.


Input
The first line contains an integer T, total number of testcases. Then follow T lines, each line contains three integers A, B and C.


Output
Display the second largest among A, B and C.

Constraints

1 ≤ T ≤ 1000
1 ≤ A,B,C ≤ 1000000


Example

Input
3 
120 11 400
10213 312 10
10 3 450

Output

120
312
10
t = input() #Takes the number of test cases
#print t

while t > 0:

    numbers = map(int, raw_input().split())
    #Takes space separated integers into the list numbers
    #print numbers
    numbers.remove(max(numbers)) #Removes the largest number from the list
    #print numbers
    numbers.remove(min(numbers)) #Removes the smallest number from the list
    #print numbers
    print numbers[0] #Displays second largest number in the list

    t -= 1