// ---------- begin scannner ---------- #[allow(dead_code)] mod scanner { use std::str::FromStr; pub struct Scanner<'a> { it: std::str::SplitWhitespace<'a>, } impl<'a> Scanner<'a> { pub fn new(s: &'a String) -> Scanner<'a> { Scanner { it: s.split_whitespace(), } } pub fn next(&mut self) -> T { self.it.next().unwrap().parse::().ok().unwrap() } pub fn next_bytes(&mut self) -> Vec { self.it.next().unwrap().bytes().collect() } pub fn next_chars(&mut self) -> Vec { self.it.next().unwrap().chars().collect() } pub fn next_vec(&mut self, len: usize) -> Vec { (0..len).map(|_| self.next()).collect() } } } // ---------- end scannner ---------- use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); let mut sc = scanner::Scanner::new(&s); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); run(&mut sc, &mut out); } fn run(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter) { let m = 19; let mut dp = vec![[0u64; 2]; 1 << m]; dp[0][0] = 1; for i in 0..m { let l: usize = sc.next(); let a = (0..l).map(|_| sc.next::() - 1).collect::>(); for j in (0usize..(1 << m)).filter(|bit| bit.count_ones() == (i as u32)) { let v = dp[j]; for &a in a.iter().filter(|&&a| j >> a & 1 == 0) { let c = (j >> a).count_ones() as usize & 1; let x = j | (1 << a); dp[x][c] += v[0]; dp[x][c ^ 1] += v[1]; } } } let ans = dp[(1 << m) - 1]; println!("{} {}", ans[0], ans[1]); }