#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;
class mypcmp {
public:
    bool operator()(const int& a, const int& b) {
        return a<b;
    }
};


int vs[19][19];
int cs[19];
LL dp[2][19][1<<19];
char dpm[19][1<<19];
void dfs(int i, int m, int j) {
    if (m==0) i=0;
    if (dpm[i][m]) return;
    dpm[i][m]=1;
    int nm, x;
    LL r1=0, r0=0;
    // int j=0; for (j=0; j<19; j++) if ((1<<j)&m) break;
    int nj; for (nj=j+1; nj<19; nj++) if ((1<<nj)&m) break;
    if (nj>=19) nj=0;
    // printf("dfs %d %x, j is %d, nj is %d\n", i, m, j, nj);
    int k; for (k=0; k<cs[i]; k++) {
        x = vs[i][k];
        if (((1<<x)&m)==0) continue;
        if (x==j) {
            nm = m^(1<<x);
            dfs(nj, nm, nj);
            r0+=dp[1][nj][nm];
            r1+=dp[0][nj][nm];
        } else {
            nm = m^(1<<x);
            dfs(x, nm, j);
            r1+=dp[1][x][nm];
            r0+=dp[0][x][nm];
        }
    }
    dp[0][i][m]=r0;
    dp[1][i][m]=r1;
}
int mx[32];
char bb[(1<<19)+4];
int main() {
    int n, i, j, mm, m, nj, k, x, nm, xx, cm;
    LL r1, r0;
    x=1; for (i=0; i<19; i++) { bb[x]=i; x<<=1; }
    for (i=0; i<19; i++) {
        mx[i]=0;
        scanf("%d", &n); cs[i]=n;
        for (j=0; j<n; j++) {
            scanf("%d", &vs[i][j]);
            vs[i][j]--;
            mx[i]|=(1<<vs[i][j]);
        }
    }
    // memset(dpm, 0, sizeof(dpm));
    // dpm[0][0]=1;
    dp[0][0][0]=1; dp[1][0][0]=0;
    mm=(1<<19);
    for (m=1; m<mm; m++) {
        for (j=0; j<19; j++) if ((1<<j)&m) break;
        for (nj=j+1; nj<19; nj++) if ((1<<nj)&m) break; if (nj>=19) nj=0;
        for (i=0; i<19; i++) {
            r0=r1=0;
            xx = mx[i]&m;
            while(xx) {
                cm = xx&(-xx);
            // for (k=0; k<cs[i]; k++) {
            //     x=vs[i][k];
            //     if (((1<<x)&m)==0) continue;
            //     x = vs[i][k];
                x = bb[cm];
                if (x==j) {
                    // nm = m^(1<<x);
                    nm = m^cm;
                    r0+=dp[1][nj][nm];
                    r1+=dp[0][nj][nm];
                } else {
                    // nm = m^(1<<x);
                    nm = m^cm;
                    r1+=dp[1][x][nm];
                    r0+=dp[0][x][nm];
                }
                xx&=(xx-1);
            }
            dp[0][i][m]=r0;
            dp[1][i][m]=r1;
        }
    }
    // dfs(0, mm-1, 0);
    printf("%lld %lld\n", dp[1][0][mm-1], dp[0][0][mm-1]);
    return 0;
}