require "big"
n, m = read_line.split.map(&.to_i)
p = (0...n).to_a
m.times do
  s = read_line.split.map { |v| v.to_i - 1 }
  s.shift
  tmp = p[s[-1]]
  (s.size - 2).downto(0) do |i|
    p[s[i + 1]] = p[s[i]]
  end
  p[s[0]] = tmp
end
visited = Array.new(n, false)
ans = BigInt.new(1i64)
n.times do |i|
  next if visited[i]
  cur = i
  len = 0i64
  while !visited[cur]
    visited[cur] = true
    cur = p[cur]
    len += 1
  end
  ans = ans.lcm(len)
end
puts ans % 998244353