1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
k, n0 = list(map(int, input().split()))
lz = [[0 for i in range(n0)]]
for i in range(k-1):
    opis = list(map(int, input().split()))
    lz.append(opis[1:])

i = k-1
lo = [1 for u in range(len(lz[i]))]

maks = 0
while True:
    loc = sum(lo)
    if loc>maks:
        maks = loc
    if i == 0:
        print(maks)
        break
    plo = [0 for u in range(len(lz[i-1]))]
    for j in range(len(lo)):
        if lz[i][j]>0:
            plo[lz[i][j]-1]+=lo[j]
    for j in range(len(plo)):
        if plo[j]== 0:
            plo[j] = 1
    lo = plo
    i -= 1