#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
mt19937 rng(123);

vector<int> comb(const vector<int> &A, vector<int> B) {
    for(int i = 0; i < A.size(); i++)
        B[i] = A[B[i]];
    return B;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(m);
    for(auto &i : a) {
        i.resize(n);
        for(auto &j : i) cin >> j, --j;
        // iota(all(i), 0);
        // shuffle(all(i), rng);
    }
    vector<int> id(n);
    iota(all(id), 0);
    if(m <= 20) {
        cerr << "pt1"<<endl;
        vector<vector<int>> al;
        for(int msk = 0; msk < 1 << m; msk++) {
            vector<int> cur = id;
            for(int i = 0; i < m; i++)
                if((msk >> i) & 1)
                    cur = comb(cur, a[i]);
            al.push_back(cur);
        }
        sort(all(al));
        cout << unique(all(al)) - al.begin() << endl;
    } else {
        cerr << "pt2"<<endl;
        // vector<vector<int>> 
        set<vector<int>> can;
        can.insert(id);
        for(auto &i : a) {
            set<vector<int>> nc = can;
            for(auto j : can)
                nc.insert(comb(j, i));
            can = nc;
        }
        cout << can.size() << '\n';
    }
}