// ---------- 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 n: usize = sc.next(); let m: usize = sc.next(); let w = std::mem::size_of::() * 8; let len = (n + w - 1) / w; let mut mat = vec![]; mat.push(vec![0usize; len]); let mut b = vec![!0usize; len]; if len * w != n { b[len - 1] &= (1 << (n % w)) - 1; } mat.push(b); for _ in 0..m { let l = sc.next::(); let mut a = vec![0usize; len]; for _ in 0..l { let x = sc.next::() - 1; a[x / w] |= 1 << (x % w); } let mut b = a.iter().map(|a| !*a).collect::>(); if len * w != n { b[len - 1] &= (1 << (n % w)) - 1; } mat.push(a); mat.push(b); } let mut a = mat; let mut ans = 1; while let Some(x) = a.iter().position(|a| a.iter().any(|a| *a > 0)) { let b = a.remove(x); let k = (0..n).find(|x| b[x / w] >> (x % w) & 1 == 1).unwrap(); for a in a.iter_mut() { if a[k / w] >> (k % w) & 1 == 1 { for (a, b) in a.iter_mut().zip(b.iter()) { *a ^= *b; } } } ans = 2 * ans % 998244353; } println!("{}", ans); }