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

int n, m;

map<vector<int>, int>mp;


void solve() {
	cin >> n >> m;
	vector<vector<int>>g(m);
	vector<vector<int>>h;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			int a;
			cin >> a;
			g[i].push_back(a);
		}
	}
	h.push_back(g[0]);
	for (int i = 1; i < m; i++) {
		int sum = h.size();
		vector<int>c(n);
		if (mp[g[i]] == 0) {
			mp[g[i]] = 1;
			h.push_back(g[i]);
		}
		for (int j = 0; j < sum; j++) {
			for (int k = 1; k <= n; k++) {
				c[k - 1] = h[j][g[i][k - 1] - 1];
			}
			if (mp[c] == 0) {
				mp[c] = 1;
				h.push_back(c);
			}
		}
	}
	cout << h.size() << endl;
	return;
}


signed main() {
	ios::sync_with_stdio(false);
	int tt = 1;
//	cin >> tt;
	while (tt--) {
		solve();
	}
}