import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum N = 19; void main() { try { for (; ; ) { auto A = new int[N]; foreach (i; 0 .. N) { const L = readInt; foreach (l; 0 .. L) { const u = readInt - 1; A[i] |= 1 << u; } } auto dp = new long[2][1 << N]; dp[0][0] = 1; foreach (p; 0 .. (1 << N) - 1) { const i = popcnt(p); int cnt; foreach_reverse (u; 0 .. N) { if (p & 1 << u) { ++cnt; } else { if (A[i] & 1 << u) { static foreach (s; 0 .. 2) { dp[p | 1 << u][(s + cnt) & 1] += dp[p][s]; } } } } } writeln(dp[$ - 1][0], " ", dp[$ - 1][1]); } } catch (EOFException e) { } }