Логистический максимин

number = int(input())
maximum = 0
road = 0
for element in range(number):
    tunnel = int(input())
    m = 100000000
    for element_2 in range(tunnel):
        height = int(input())
        if m > height:
            m = height
    if maximum < m:
        maximum = m
        road = road + 1
print(road, maximum)

road = 1

max_height = -1
max_road = None
for road in range(1, int(input()) + 1):
    min_height = min(int(input()) for _ in range(int(input())))
    if min_height > max_height:
        max_height = min_height
        max_road = road
print(max_road, max_height)

number = int(input())
maximum = 0
road = 1
for element in range(number):
    tunnel = int(input())
    m = 100000000
    for element_2 in range(tunnel):
        height = int(input())
        if m > height:
            m = height
    if maximum < m:
        maximum = m
        road = element + 1
print(road, maximum)

n = int(input())
Max = 0
doroga = 1
m = 9999999999
for i in range(n):
    t = int(input())
    for j in range(t):
        h = int(input())
        if m > h:
            m = h
    if Max < m:
        Max = m
        doroga = i + 1
    m = 999999
print(doroga, Max)

dorogi = int(input())
minim = 0
mininon = 0
nomer = 0
for b in range(dorogi):
    kolvo = int(input())
    for i in range(kolvo):
        visota = int(input())
        if mininon == 0:
            mininon = visota
        elif visota < mininon:
            mininon = visota
    nomer = nomer + 1
    if mininon > minim:
        minim = mininon
        nomerb = nomer
    mininon = 0
print(nomerb, minim)

s = int(input())
cou = 0
min = 999999
mmin = 0
for i in range(s):
    d = int(input())
    cou += 1
    min = 999999
    for j in range(d):
        height = int(input())
        
        if height < min:
            min = height
    if min >= mmin:
        ctr = cou
        mmin = min
print(ctr, mmin)