#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

constexpr int LIMIT = 20;

vector<int> Apply(const vector<int>& a, const vector<int>& b) {
    int n = (int)a.size();
    vector<int> c(n);
    for (int i = 0; i < n; i++) {
        c[i] = a[b[i]];
    }
    return c;
}

int Small(int m, int n, vector<vector<int>>& p) {
    vector<vector<int>> answers;
    for (int mask = 1; mask < (1 << m); mask++) {
        vector<int> res(n), temp(n);
        iota(res.begin(), res.end(), 0);
        for (int bit = 0; bit < m; bit++) {
            if (mask & (1 << bit)) {
                for (int i = 0; i < n; i++) {
                    temp[i] = res[p[bit][i]];
                }
                res = temp;
            }
        }
        answers.push_back(move(res));
    }
    sort(answers.begin(), answers.end());
    answers.resize(unique(answers.begin(), answers.end()) - answers.begin());
    return answers.size();
}

constexpr int MAXN = 180;
constexpr int MAXP = 362880;

bitset<MAXP> dp[MAXN + 1];

int Big(int m, int n, vector<vector<int>> p) {
    vector<int> perm(n);
    iota(perm.begin(), perm.end(), 0);

    map<vector<int>, int> id;
    map<int, vector<int>> perms;
    do {
        static int idx = 0;
        perms[idx] = perm;
        id[perm] = idx++;
    } while (next_permutation(perm.begin(), perm.end()));

    for (int i = 0; i < m; i++) {
        if (i > 0) {
            dp[i] |= dp[i - 1];
            for (int idx = 0; idx < perms.size(); idx++) {
                if (dp[i - 1][idx]) {
                    dp[i][id[Apply(perms[idx], p[i])]] = 1;
                }
            }
        }
        dp[i][id[p[i]]] = 1;
    }

    int answer = 0;
    for (int idx = 0; idx < perms.size(); idx++) {
        answer += dp[m - 1][idx];
    }
    return answer;
}

int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int n, m;
    cin >> n >> m;

    vector<vector<int>> p(m, vector<int>(n));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            cin >> p[i][j];
            p[i][j]--;
        }
    }

    if (m <= LIMIT) {
        cout << Small(m, n, p);
    } else {
        cout << Big(m, n, p);
    }

    return 0;
}