// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n, m;
    cin >> n >> m;
    vi order(n);
    iota(all(order), 0);

    // composition
    FOR(m) {
        int t;
        cin >> t;
        vi s(t);
        rep(j, t) {
            cin >> s[j];
            --s[j];
        }

        int lst = order[s.back()];
        for(int j = t-1; j > 0; --j) order[s[j]] = order[s[j-1]];
        order[s[0]] = lst;
    }

    // decompose
    int circle = 0;
    vector<bool> done(n, false);
    auto dfs = [&](int v, auto self) -> void {
        done[v] = true;
        ++circle;
        if(!done[order[v]]) {
            self(order[v], self);
        }
    };

    int ans = 1;

    FOR(n) {
        if(!done[i]) {
            circle = 0;
            dfs(i, dfs);
            ans = ans / __gcd(ans, circle) * circle;
        }
    }

    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}