def solve():
    N=19

    B=[[0]*N for _ in range(N)]
    for i in range(N):
        _,*Ai=map(int,input().split())
        for a in Ai:
            B[i][a-1]=1

    popcount=[0]*(1<<N)
    for S in range(1,1<<N):
        popcount[S]=popcount[S>>1]+(S&1)

    bit=lambda S,k:(S>>k)&1

    DP0=[0]*(1<<N); DP1=[0]*(1<<N)
    for S in range((1<<N)-1, -1, -1):
        if popcount[S]==N:
            DP0[S]=1
            continue

        unused=[i for i in range(N) if not bit(S,i)]
        for t in range(len(unused)):
            if B[popcount[S]][unused[t]]==1:
                T=S|(1<<unused[t])
                if t%2:
                    DP0[S]+=DP1[T]
                    DP1[S]+=DP0[T]
                else:
                    DP0[S]+=DP0[T]
                    DP1[S]+=DP1[T]

    return DP0[0], DP1[0]

#==================================================
print(*solve())