from collections import deque

n = int(input())
T = deque()

b = deque()
for i in range(n):
    m = input().split()
    a = deque()
    b.append(int(m[0]))
    if m[0] != 0:
        for j in range(1,int(m[0])+1):
            a.append(int(m[j]))
    else:
        a.append("0")
    
    T.append(a)

#print(T)
#print(sum(b))

k = 0
ans = []
while sum(b) != 0:
    if b[k%n] != 0:
        ans.append(T[k%n].popleft())
        b[k%n] -= 1
    k += 1

print(*ans)