#include<bits/stdc++.h>

using LL = long long;
const LL inf = 1e9;
const LL P[2] = {1000000007,1000000009};
const LL K = 114514;

std::array<LL,2> hash(const std::vector<int> &vec) {
	std::array<LL,2> res = {0,0},unit = {1,1};
	int n = vec.size() - 1;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < 2; ++j) {
			res[j] = (res[j] + unit[j] * vec[i]) % P[j];
			unit[j] = unit[j] * K % P[j];
		}
	}
	return res;
}

void solve() {

	int n,m;std::cin >> n >> m;
	std::vector pmt(m,std::vector<int>(n+1));
	for (int i = 0; i < m; ++i) {
		for (int j = 0; j < n; ++j) {
			std::cin >> pmt[i][j];
		}
	}
	std::map<std::array<LL,2>,int> mp;
	std::priority_queue<std::pair<int,std::vector<int>>,std::vector<std::pair<int,std::vector<int>>>,std::greater<>> q;
	for (int i = 0; i < m; ++i) {
		pmt[i][n] = i;
		q.emplace(i+1,pmt[i]);
	}
	while (!q.empty()) {
		auto [point,vec] = q.top();q.pop();
		auto hsh = hash(vec);
		if (!mp.count(hsh)) {
			mp[hsh] = vec.back();
		} else {
			if (mp[hsh]+1 < vec.back()) {
				continue;
			}
		}
		if (point == m) continue;
		q.emplace(point+1,vec);
		for (int i = 0; i < n; ++i) {
			vec[i] = pmt[point][vec[i] - 1];
		}
		vec[n] = point;
		q.emplace(point+1,vec);
	}
	std::cout << mp.size();
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

//    clock_t st = clock();
//    std::cout << std::fixed << std::setprecision(12);

//    freopen("test.in", "r", stdin);
//    freopen("test.out", "w", stdout);

	int T = 1;
//	std::cin >> T;
	while (T --) {
		solve();
	}

//    std::cout << (double)(clock()-st)/CLOCKS_PER_SEC;

	return 0;
}