//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

const int M = 1e9+7;

int permToInt(vi v) {
	int use = 0, i = 0, r = 0;
	for(int x:v) r = r * ++i + __builtin_popcount(use & -(1<<x)),
		use |= 1 << x;                     // (note: minus, not ~!)
	return r;
}

vector<int> apply(vector<int> &a, 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;
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin.exceptions(cin.failbit);

	int n, m; cin >> n >> m;
	vector<vector<int>> 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]--;
		}
	}

	if (n <= 9) {
		vector<bool> dp(362880);
		vector<int> pr(n);
		for (int i = 0; i < n; i++) {
			pr[i] = i;
		}

		for (auto b: a) {
			vector<bool> nxt = dp;
			sort(pr.begin(), pr.end());

			do {
				int u = permToInt(pr);
				if (dp[u]) {
					int v = permToInt(apply(pr, b));
					nxt[v] = 1;
				}
			} while (next_permutation(pr.begin(), pr.end()));

			nxt[permToInt(b)] = 1;
			swap(dp, nxt);
		}

		int ans = 0;
		for (int i: dp) {
			if (i) ans++;
		}
		cout << ans << '\n';
	} else {
		// m <= 20
		set<vector<int>> st;

		vector<int> pr(n);
		for (int i = 0; i < n; i++) {
			pr[i] = i;
		}

		for (int i = 1; i < (1 << m); i++) {
			sort(pr.begin(), pr.end());
			for (int j = 0; j < m; j++) {
				if (i & (1 << j)) {
					pr = apply(pr, a[j]);
				}
			}
			st.insert(pr);
		}

		cout << st.size() << '\n';
	}

	return 0;
}