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

int n, m;

vector<int> f(vector<int>& v1, vector<int>& v2)
{
    vector<int> res(n);
    for (int i = 0; i < n; ++i) {
        res[i] = v1[v2[i]];
    }
    return res;
}

void solve()
{
    cin >> n >> m;
    vector<vector<int>> v(m, vector<int>(n));
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) cin >> v[i][j], --v[i][j];
    }
    if (m > 20) {
        int ord = 0;
        vector<int> per(n);
        iota(per.begin(), per.end(), 0);
        vector<vector<int>> ps;
        vector<int> cur = per;
        map<vector<int>, int> mp;
        ps.push_back(cur);
        if (!mp.count(cur)) mp[cur] = ord++;
        next_permutation(cur.begin(), cur.end());
        while (cur != per) {
            ps.push_back(cur);
            if (!mp.count(cur)) mp[cur] = ord++;
            next_permutation(cur.begin(), cur.end());
        }
        vector<vector<bool>> dp(m, vector<bool>(ord));
        dp[0][mp[v[0]]] = 1;
        for (int i = 1; i < m; ++i) {
            dp[i][mp[v[i]]] = 1;
            for (int j = 0; j < ord; ++j) {
                if (dp[i - 1][j]) dp[i][j] = dp[i][mp[f(ps[j], v[i])]] = 1;
            }
        }
        cout << count(dp[m - 1].begin(), dp[m - 1].end(), 1) << '\n';
    }
    else {
        set<vector<int>> s;
        for (int i = 1; i < (1 << m); ++i) {
            vector<int> res(n);
            iota(res.begin(), res.end(), 0);
            for (int j = 0; j < m; ++j) {
                if (i >> j & 1) {
                    res = f(res, v[j]);
                }
            }
            s.insert(res);
        }
        cout << s.size() << '\n';
    }
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}