#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int mod = 1E9 + 7;

void solve () {
    int n, m;
    cin >> n >> m;

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

    auto work = [&](vector <int> a) {
        int t = 0;
        for (auto x : a) {
            t = t * 10 + x + 1;
        } 
        return t;
    };

    if (m <= 20) {
        for (int s = 1; s < (1 << m); s ++) {
            vector <int> p;
            for (int j = 0; j < m; j ++) {
                if (s >> j & 1) {
                    p.push_back (j);
                }
            }
            auto c = a[p[0]];
            for (int j = 1; j < p.size (); j ++) {
                auto nc = c;
                for (int i = 0; i < n; i ++) {
                    nc[i] = c[a[p[j]][i]];
                }
                c = move (nc);
            }
            st.insert (work (c));
        }
        cout << st.size () << '\n';
    } else {
        map <int, int> dp;
        for (int j = 0; j < m; j ++) {
            auto ndp = dp;
            vector <int> p (n);
            iota (p.begin (), p.end (), 0);
            do {
                vector <int> c (n);
                for (int i = 0; i < n; i ++) {
                    c[i] = p[a[j][i]];
                }
                auto t = work (p);
                auto nt = work (c);
                ndp[nt] |= dp[t];
            } while (next_permutation (p.begin (), p.end ()));
            dp = move (ndp);
            int t = work (a[j]);
            dp[t] = 1;
        }
        int ans = 0;
        for (auto [_, x] : dp) {
            ans += x;
        }

        cout << ans << '\n';
    }
} 

signed main () {
	ios::sync_with_stdio (false);
    cin.tie (nullptr);
    
	int T = 1; 
	// cin >> T;

	while (T --) {
		solve ();
	}
    
	return 0;
}