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()

while t>0:
    list=[]
    a,b,c=map(int, raw_input().split())
    list.append(a)
    list.append(b)
    list.append(c)
    list.sort()
    print list[1]
    t-=1