#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

pair<vector<int>, vector<int>> primes_lpf(const int n) {
  vector<int> primes; primes.reserve(n / 10);
  vector<int> lpf(n + 1);
  for (int i = 2; i <= n; i += 2) lpf[i] = 2;
  for (int i = 3; i <= n; i += 6) lpf[i] = 3;
  if (2 <= n) primes.push_back(2);
  if (3 <= n) primes.push_back(3);
  // 5 * x <= n, x <= floor(n / 5)
  const int n5 = n / 5;
  int x = 5;
  char add_next = 2;
  for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) {
    int px = lpf[x];
    if (px == 0) {
      lpf[x] = px = x;
      primes.push_back(x);
    }
    for (int i = 2;; ++i) {
      int q = primes[i];
      int y = q * x;
      if (y > n) break;
      lpf[y] = q;
      if (q == px) break;
    }
  }
  for (; x <= n; x += add_next, add_next ^= 2 ^ 4) {
    if (lpf[x] == 0) {
      lpf[x] = x;
      primes.push_back(x);
    }
  }
  return {move(primes), move(lpf)};
}

constexpr int PSIZE = 1000010;
auto [primes, lpf] = primes_lpf(PSIZE);

vector<pair<int, int>>& factorize_lv(int x) {
  int ps[10], cs[10];
  int sz = 0;
  while (x != 1) {
    int p = lpf[x], c = 0;
    do {x /= p; c++;} while (x % p == 0);
    ps[sz] = p; cs[sz] = c; sz++;
  }
  static vector<pair<int, int>> fs;
  fs.clear();
  for (int i = 0; i < sz; i++) fs.emplace_back(ps[i], cs[i]);
  return fs;
}

vector<vector<int>> cycle_decomposition(const vector<int>& a) {
  const int n = a.size();
  vector<char> visited(n);
  vector<vector<int>> res;
  for(int i = 0; i < n; i++) if (!visited[i]) {
    res.emplace_back();
    auto& vs = res.back();
    int v = i;
    do {
      visited[v] = true;
      vs.push_back(v);
      v = a[v];
    } while (v != i);
  }
  return res;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI s(n);
  iota(all(s), 0);
  VI s_inv(n);
  iota(all(s_inv), 0);
  rep(_, m) {
    int t;
    cin >> t;
    static VI d;
    d.resize(t);
    rep(i, t) cin >> d[i], d[i]--;
    static VI d_orig;
    d_orig.resize(t);
    rep(i, t) d_orig[i] = s_inv[d[i]];
    rotate(d.begin(), d.begin() + 1, d.end());
    rep(i, t) s[d_orig[i]] = d[i], s_inv[d[i]] = d_orig[i];
  }
  VI e(PSIZE);
  for(const auto& c : cycle_decomposition(s)) {
    for(auto [p, c] : factorize_lv(c.size())) {
      chmax(e[p], c);
    }
  }
  mint ans = 1;
  rep(i, PSIZE) if (e[i]) {
    ans *= mint(i).pow(e[i]);
  }
  cout << ans.val() << '\n';
}