#include using namespace std; using ll = long long; using pll = pair; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60; const int IINF = (1 << 30) - 1; template struct Edge{ int to; T w; Edge(int to_, T w_=1){ to = to_; w=w_; } }; template using Tree = vector>>; template using Graph = vector>>; /* 容量&重み付きエッジ for Dinic */ template struct REdge{ int to; T cap; T cost; int rev; REdge(int to_, T cap_, T cost_=1){ to = to_; cap = cap_; cost = cost_; } REdge(int to_, T cap_, T cost_, int rev_){ to = to_; cap = cap_; cost = cost_; rev = rev_; } }; /* 残余グラフ for Dinic */ template using RGraph = vector>>; struct UnionFind{ vector parent; vector sizes; UnionFind(ll N) : parent(N), sizes(N, 1){ rep(i, N) parent[i] = i; } ll root(ll x){ if (parent[x] == x) return x; return parent[x] = root(parent[x]); } void unite(ll x, ll y){ ll rx = root(x); ll ry = root(y); if (rx == ry) return; if (sizes[rx] < sizes[ry]) swap(rx, ry); sizes[rx] += sizes[ry]; parent[ry] = rx; } bool same(ll x, ll y){ ll rx = root(x); ll ry = root(y); return rx == ry; } ll size(ll x){ return sizes[root(x)]; } }; template class modint{ long long x; public: modint(long long x=0) : x((x%mod+mod)%mod) {} modint operator-() const { return modint(-x); } bool operator==(const modint& a){ if(x == a) return true; else return false; } bool operator==(long long a){ if(x == a) return true; else return false; } bool operator!=(const modint& a){ if(x != a) return true; else return false; } bool operator!=(long long a){ if(x != a) return true; else return false; } modint& operator+=(const modint& a) { if ((x += a.x) >= mod) x -= mod; return *this; } modint& operator-=(const modint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } modint& operator*=(const modint& a) { (x *= a.x) %= mod; return *this; } modint operator+(const modint& a) const { modint res(*this); return res+=a; } modint operator-(const modint& a) const { modint res(*this); return res-=a; } modint operator*(const modint& a) const { modint res(*this); return res*=a; } modint pow(long long t) const { if (!t) return 1; modint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod modint inv() const { return pow(mod-2); } modint& operator/=(const modint& a) { return (*this) *= a.inv(); } modint operator/(const modint& a) const { modint res(*this); return res/=a; } friend std::istream& operator>>(std::istream& is, modint& m) noexcept { is >> m.x; m.x %= mod; if (m.x < 0) m.x += mod; return is; } friend ostream& operator<<(ostream& os, const modint& m){ os << m.x; return os; } }; using mint = modint; int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); ll n, m; cin >> n >> m; vector> s(m); rep(i, m){ ll t; cin >> t; rep(j, t){ ll tmp; cin >> tmp; tmp--; s[i].pb(tmp); } } vector p(n, 0); rep(i, n) p[i] = i; rep(i, m){ ll t = (ll)s[i].size(); ll tmp = p[s[i][t-1]]; for(ll j=t-1; j>0; j--) p[s[i][j]] = p[s[i][j-1]]; p[s[i][0]] = tmp; } UnionFind uf(n); rep(i, n) uf.unite(i, p[i]); vector cnt(n+1, 0); rep(i, n) if(uf.root(i)==i){ ll c = uf.size(i); vector prime; ll sc = c; for(ll x=2; x*x<=c; x++){ if(sc%x!=0) continue; ll cnt_x = 0; while(sc%x==0){ cnt_x++; sc/=x; } prime.pb({x, cnt_x}); } if(sc!=1) prime.pb({sc, 1}); for(pll tmp : prime){ cnt[tmp.fi] = max(cnt[tmp.fi], tmp.se); } } mint ans = 1; for(ll i=1; i<=n; i++){ ans *= mint(i).pow(cnt[i]); } cout << ans << endl; }