/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n,m;
vector <int> vec[205];
vector <int> merge(vector <int> A,vector <int> B)
{
	vector <int> C;
	for(int i=0;i<A.size();i++) C.pb(A[B[i]]);
	return C;
}
map <vector<int>,int> ma;
void solve()
{
	cin>>n>>m;
	for(int i=0;i<m;i++) for(int j=0;j<n;j++) 
	{
		int x;
		cin>>x;
		vec[i].pb(x-1);
	}
	int ans=0;
	if(m<=18)
//	if(0)
	{
		for(int mask=1;mask<(1<<m);mask++)
		{
			vector <int> t;
			for(int i=0;i<n;i++) t.pb(i);
			for(int i=0;i<m;i++) if(mask&(1<<i)) t=merge(t,vec[i]);
			if(!ma[t]) ma[t]=1,ans++;
		}
		cout<<ans<<"\n";
	}
	else
	{
		vector <vector<int> > t;
		t.resize(1);
		for(int i=0;i<n;i++) t[0].pb(i);
		for(int i=0;i<m;i++)
		{
			vector <vector<int> > t2;
			ma.clear();
			for(int j=0;j<t.size();j++) 
			{
				if(!ma[t[j]]) ma[t[j]]=1,t2.pb(t[j]);
				vector <int> x=merge(t[j],vec[i]);
				if(!ma[x]) ma[x]=1,t2.pb(x);
			}
			t=t2;
		}
		cout<<t.size()<<"\n";
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}