import sys
from collections import deque, Counter
sys.setrecursionlimit(5 * 10 ** 5)
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n = 19
A = []
even = 0
odd = 0
for i in range(n):
    x = li()
    now = 0
    for v in x[1:]:
        now |= 2 ** (v-1)
    A.append(now)
    if i % 2:
        odd |= now
    else:
        even |= now

ppcnt = [0] * (1 << n)
for i in range(1<<n):
    ppcnt[i] = ppcnt[i//2] + i % 2

dp0 = [0] * (1<<n)
dp1 = [0] * (1<<n)
dp0[0] = 1
for bit in range(1<<n):
    for i in range(n):
        if not(1 & (bit >> i)):
            if 1 & (A[i] >> (ppcnt[bit])):
                if i != ppcnt[bit] + 1:
                    dp1[bit | (1<<i)] += dp0[bit]
                    dp0[bit | (1<<i)] += dp1[bit]
                else:
                    dp1[bit | (1<<i)] += dp1[bit]
                    dp0[bit | (1<<i)] += dp0[bit]


print(dp0[-1], dp1[-1])