#include <bits/stdc++.h>
// #define int long long

#define F(i, a, b) for (int i = (a); i <= (b); i++)
#define dF(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 1000005;
int n, m;
bool f[185][N];
auto work(vector<int> a, vector<int> b) {
	vector<int> c(n + 1, 0);
	F(i, 1, n) c[i] = a[b[i]];
	return c;
}
auto get(vector<int> &v) {
	unsigned long long h = 0;
	F(i, 1, n)
		h = h * 10000007 + v[i];
	return h;
}
signed main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    vector<vector<int> > a(m + 1);
    F(i, 1, m) {
    	a[i].resize(n + 1, 0);
    	F(j, 1, n) cin >> a[i][j];
    }
    map<unsigned long long, int> mp;
    if (m <= 18) {
    	for (int s = 1; s < 1 << m; s++) {
    		vector<int> vec;
    		for (int i = 1; i <= m; i++) {
    			if (s >> i - 1 & 1) {
    				if (vec.empty()) vec = a[i];
    				else vec = work(vec, a[i]);
    			}
    		}
    		mp[get(vec)] = 1;
    	}
    	cout << mp.size() << '\n';
    } else {
    	vector<vector<int> > g;
    	vector<int> p(n + 1, 0);
    	F(i, 1, n) p[i] = i;
    	do {
    		g.push_back(p);
    		mp[get(p)] = g.size() - 1;
    	} while (next_permutation(p.begin() + 1, p.end()));
    	for (int i = 1; i <= m; i++) {
    		for (int j = 0; j < g.size(); j++) {
    			if (!f[i - 1][j]) continue;
    			auto x = work(g[j], a[i]);
    			f[i][j] = 1;
    			f[i][mp[get(x)]] = 1;
    		}
    		f[i][mp[get(a[i])]] = 1;
    	}
    	int ans = 0;
    	for (int i = 0; i < g.size(); i++) {
    		if (f[m][i]) ans++;
    	}
    	cout << ans << '\n';
    }
    return 0;
}