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
#First And The Last Digit

def main():
    T = int(raw_input())
    while(T!=0):
        T-=1
        NS = []
        N = raw_input().split()
        for i in N:
            #N.remove(i)
            NS.append(int(i))
        NS.sort()
        print int(NS[-2])
        

if __name__ == '__main__':
    main()