#include <bits/stdc++.h>


using namespace std;


using ll = long long;

#define rep(i, n) for(int i = 0; i < (n); i += 1)
#define rng(i, start, end, step) for(int i = start; i < end; i += step)
#define len(a) ((int)(a).size())


mt19937 rnd(234);

vector<int> operator*(const vector<int>& a, const vector<int>& b) {
    int n = len(a);
    vector<int> c(n);
    rep(i, n) c[i] = a[b[i]];
    return c;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(m, vector<int>(n));
    rep(i, m) rep(j, n) { cin >> a[i][j]; --a[i][j]; }
    vector<vector<vector<int>>> dp(m + 1);
    vector<int> I(n);
    rep(i, n) I[i] = i;
    dp[m].push_back(I);
    bool great = false;
    for (int i = m - 1; i >= 0; i -= 1) {
        for (auto p : dp[i + 1]) {
            dp[i].push_back(p);
            auto q = a[i] * p;
            dp[i].push_back(q);
            if (!great and q == I) great = true;
        }
        sort(dp[i].begin(), dp[i].end());
        dp[i].resize(unique(dp[i].begin(), dp[i].end()) - dp[i].begin());
    }
    cout << len(dp[0]) + int(great) - 1 << "\n";
    return 0;
}