#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for (int i = (a); i <= (b); ++i)

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define N 181
#define eb emplace_back
#define all(s) (s).begin(), (s).end()

vector<int> s[N], as[362881];

set<vector<int>> res;

bool f[362881], g[361881];

map<vector<int>, int> tr;


int main() {
	int n = rd(), m = rd();
	rep(i, 0, m - 1) rep(j, 1, n) s[i].eb(rd());
	
	auto work1 = [&]() {
		rep(S, 1, (1 << m) - 1) {
			vector<int> cur, tmp(n, 0); 
			rep(i, 1, n) cur.eb(i);  
			rep(j, 0, m - 1)
				if ((S >> j) & 1) {
					rep(i, 1, n) tmp[i - 1] = cur[s[j][i - 1] - 1];
					swap(tmp, cur);
				}
			res.insert(cur);
		}
		printf("%d\n", (int)res.size());
	};

	auto work2 = [&]() {
		int tot = 0;
		vector<int> t;
		rep(i, 1, n) t.eb(i);
		do {
			as[++tot] = t;
			tr[as[tot]] = tot;
		} while (next_permutation(all(t)));
		rep(j, 0, m - 1) {
			f[tr[s[j]]] = 1;
			rep(x, 1, tot) if (g[x]) {
				vector<int> cur = as[x], tmp(n, 0);
				rep(i, 1, n) tmp[i - 1] = cur[s[j][i - 1] - 1];
				f[tr[tmp]] = true;
			}
			rep(x, 1, tot) g[x] = f[x];
		}
		int ans = 0;
		rep(x, 1, tot) ans += f[x];
		printf("%d\n", ans);
	};

	if (m <= 20) work1();
	else work2();
	return 0;
}