#include<bits/stdc++.h>

using namespace std;

#define int long long

void solve(){
	int n,m;
	cin >> n >> m;
	int a[m + 1][n + 1];
	for (int i = 1;i <= m;i ++){
		for (int j = 1;j <= n;j ++)
			cin >> a[i][j];
	}
	//int res[362880][n + 1];
	int ans = 0;
	int res[362][n + 1];
	int cnt = 0;
	for (int i = 1;i <= m;i ++){
		ans = cnt;
		for (int j = 0;j < ans;j ++){
			int c[n + 1];
			bool check = 1;
			for (int k = 1;k <= n;k ++)
				c[k] = res[j][a[i][k]];
			for (int j = 0;j < ans;j ++){
				bool f = 1;
				for (int k = 1;k <= n;k ++)
					if (res[j][k] != res[i][k]){
						f = 0;
						break;
					}
				if (f){
					check = 0;
					break;
				}
			}
			if (check){
				for (int j = 1;j <= n;j ++)
					res[cnt][j] = c[j];
				cnt ++;
			}
		}
		
		
		
		//shifouchongfu
		bool check = 1;
		for (int j = 0;j < cnt;j ++){
			bool f = 1;
			for (int k = 1;k <= n;k ++)
				if (res[j][k] != a[i][k]){
					f = 0;
					break;
				}
			if (f){
				check = 0;
				break;
			}
		}
		if (check){
			for (int j = 1;j <= n;j ++)
				res[cnt][j] = a[i][j];
			cnt ++;
		}	
		
	}
	cout << cnt << "\n";
	/*for (int i = 0;i < cnt;i ++){
		for (int j = 1;j <= n;j ++)
			cout << res[i][j] << " ";
		cout << "\n";
	}*/
	
//	map<vector<int> , bool> mp;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	solve();
}