#include<bits/stdc++.h>

using LL = long long;
const LL inf = 1e9;
const LL P = 99824353;
LL K = 1;

void init(){
	std::mt19937 rnd(std::random_device{}());
	K = rnd() % P;
	K = std::max(K,10ll);
}

LL hash(const std::vector<int> &vec) {
	LL res = 0,unit = 1;
	for (auto x : vec) {
		res = (res + unit * x) % P;
		unit = unit * K % P;
	}
	return res;
}

void solve() {
	int n,m;std::cin >> n >> m;
	std::vector pmt(m,std::vector<int>(n));
	for (int i = 0; i < m; ++i) {
		for (int j = 0; j < n; ++j) {
			std::cin >> pmt[i][j];
		}
	}
	std::sort(pmt.begin(),pmt.end());
	m = std::unique(pmt.begin(),pmt.end()) - pmt.begin();
	std::vector<int> res(n);
	std::map<LL,int> mp;
	for (int s = 1; s < (1 << m); ++s) {
		res[0] = 0;
		for (int i = 0; i < m; ++i) {
			int biti = 1 << i;
			if (biti & s) {
				if (res[0] == 0) {
					for (int j = 0; j < n; ++j) {
						res[j] = pmt[i][j];
					}
				} else {
					for (int j = 0; j < n; ++j) {
						res[j] = pmt[i][res[j] - 1];
					}
				}
			}
		}
		LL hsh = hash(res);
		mp[hsh] = 1;
	}
	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);

	init();

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

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

	return 0;
}