2693.py

t = int(input())

def quick_sort(array):
    if len(array) <=1:
        return array
    pivot = array[0]
    tail = array[1:]

    left_side = [x for x in tail if x<=pivot]
    right_side = [x for x in tail if x>pivot]

    return quick_sort(left_side) + [pivot] + quick_sort(right_side)

for i in range(t):
    data = list(map(int,input().split()))
    #print(data)
    result = quick_sort(data)
    print(result[-3])