#include <bits/stdc++.h>
using namespace std;
#define int long long

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

void GENSHEN_START() {
	int n,m;cin >> n >> m;
	vector c(m + 5,vector<int>(n + 5));
	for (int i = 1;i <= m;i++) {
		for (int j = 0;j < n;j++) cin >> c[i][j];
	}
	if (n <= 9) {
		set<vector<int>>s;
		for (int i = 1;i <= m;i++) {
			vector<int>a;
			for (int j = 0;j < n;j++) {
				a.push_back(c[i][j]);
			}
			if (s.empty()) s.insert(a);
			else {
				vector<int>b;
				set<vector<int>>s1;
				for (auto j : s) {
					for (int k = 0;k < n;k++) {
						b.push_back(j[a[k] - 1]);
					}
					s1.insert(b);
				}
				s.insert(a);
				for (auto j : s1) s.insert(j);
			}
		}
		cout << s.size() << '\n';
		return ;
	}
	if (m <= 20) {
		set<vector<int>>s;
		for (int i = 1;i < (1ll << m);i++) {
			vector<int>a;
			for (int j = 0;j < m;j++) {
				if ((i >> j) & 1) {
					if (a.empty()) {
						for (int k = 0;k < n;k++) {
							a.push_back(c[j + 1][k]);
						}
					}
					else {
						vector<int>b;
						for (int k = 0;k < n;k++) {
							b.push_back(a[c[j + 1][k] - 1]);
						}
						for (int k = 0;k < n;k++) a[k] = b[k];
					}
				}
			}
			s.insert(a);
		}
		cout << s.size() << '\n';
		return ;
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	//cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}