#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=185;
const int base=197,M=200400217;
int n,m,a[N][N];
struct node{
	int a[N];
}tmp;
vector<node> v;
map<int,int>mp;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int s=0;
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
			s=(1ll*s*base%M+a[i][j])%M;
		}
		mp[s]=1;
	}
	int ans=m;
	for(int i=1;i<=m;i++){
		for(auto x:v){
			int s=0;
			for(int j=1;j<=n;j++){
				tmp.a[j]=x.a[a[i][j]];
				s=(1ll*s*base%M+tmp.a[j])%M;
			}
			if(!mp.count(s)){
				mp[s]=1;
				v.push_back(tmp);
				ans++;
				if(ans>1e9+7)ans-=1e9+7;
			}
		}
		for(int j=1;j<=n;j++){
			tmp.a[j]=a[i][j];
		}
		v.push_back(tmp);
	}
	cout<<ans<<"\n";
	return 0;
}