#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

int n, m;
int A[181][181];
vector<int> ps[362880];

int head = 1;
int to[4000000][10];
int val[4000000];

void insert_num(int v, int num, vector<int>& p, int idx) {
    if (idx == (int)p.size()) {
        val[v] = num;
        return;
    }

    if (to[v][p[idx]] == 0) to[v][p[idx]] = head++;

    insert_num(to[v][p[idx]], num, p, idx + 1);
}

int get_num(int v, vector<int>& p, int idx) {
    if (idx == (int)p.size()) {
        return val[v];
    } else {
        return get_num(to[v][p[idx]], p, idx + 1);
    }
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cin >> m >> n;
    
    rep (i, n) rep (j, m) cin >> A[i][j], A[i][j]--;

    if (n <= 20) {
        set<vector<int>> st;
        rep (i, 1, 1 << n) {
            vector<int> p[2];
            rep (j, 2) {
                p[j].resize(m);
                iota(all(p[j]), 0);
            }

            int cnt = 0;
            rep (j, n) {
                if (!(i >> j & 1)) continue;
                rep (k, m) {
                    p[cnt ^ 1][k] = p[cnt][A[j][k]];
                }
                cnt ^= 1;
            }

            st.insert(p[cnt]);
        }

        cout << st.size() << endl;

    } else {
        vector<int> p(m);
        iota(all(p), 0);
        int cnt = 0;
        do {
            insert_num(0, cnt, p, 0);
            ps[cnt++] = p;
        } while (next_permutation(all(p)));

        vector<vector<int>> dp(n + 1, vector<int>(cnt, 0));
        dp[0][0] = true;
        bool flag = false;
        rep (i, n) {
            rep (j, cnt) {
                if (!dp[i][j]) continue;

                dp[i + 1][j] = true;

                vector<int> np(m);
                rep (k, m) {
                    np[k] = ps[j][A[i][k]];
                }

                int tonum = get_num(0, np, 0);
                if (tonum == 0) flag = true;
                dp[i + 1][tonum] = true;
            }
        }

        int ans = flag;
        rep (i, 1, cnt) {
            ans += dp[n][i];
        }

        cout << ans << endl;
    
    }
}