#include <bits/stdc++.h>

using namespace std;
using pi = pair<int, int>;
constexpr int INF = 1e9 + 7;

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> all(m, vector<int>(n));
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> all[i][j];
            --all[i][j];
        }
    }
    auto conv = [&](const vector<int> &a, const vector<int> &b) {
        int n = a.size();
        vector<int> c(n);
        for (int i = 0; i < n; ++i) {
            c[i] = a[b[i]];
        }
        return c;
    };
    if (m <= 20) {
        set<vector<int>> s;
        for (int mask = 1; mask < (1 << m); ++mask) {
            vector<int> cur(n);
            iota(cur.begin(), cur.end(), 0);
            for (int i = 0; i < m; ++i) {
                if ((1 << i) & mask) {
                    cur = conv(cur, all[i]);
                }
            }
            s.insert(cur);
        }
        cout << s.size() << "\n";
    } else {
        vector<vector<int>> mp;
        map<vector<int>, int> who;
        {
            vector<int> cur(n);
            iota(cur.begin(), cur.end(), 0);
            do {
                who[cur] = mp.size();
                mp.push_back(cur);
            } while (next_permutation(cur.begin(), cur.end()));
        }
        int K = mp.size();
        vector<int> dp(K, 0);
        vector<int> new_dp(K, 0);
        dp[0] = 1;
        for (auto &v: all) {
            new_dp = dp;
            for (auto &[p, id]: who) {
                if (!dp[id])continue;
                int to = who[conv(p, v)];
                new_dp[to] = min(2, new_dp[to] + dp[id]);
            }
            swap(dp, new_dp);
        }
        --dp[0];
        int re = 0;
        for (auto x: dp)re += x > 0;
        cout << re << "\n";
    }

}