#include<bits/stdc++.h>
#ifndef xxx
#define dbg(...) ;
#endif
using namespace std;
template<class T> ostream &operator<<(ostream &o, const vector <T> &v) { bool f=false; for(T i:v) { f?o<<' ':o; o<<(i); f=true; } return o; }
template<class T> void sort(T &v) { std::sort(v.begin(), v.end()); }
template<class T, class C> void sort(T &v, C c) { std::sort(v.begin(), v.end(), c); }
template<class T> void reverse(T &v) { std::reverse(v.begin(), v.end()); }
template<class T> bool is_sorted(T &v) { return std::is_sorted(v.begin(), v.end()); }
template<class T> inline void _min(T &x, const T &y) { x>y?x=y:x; }
template<class T> inline void _max(T &x, const T &y) { x<y?x=y:x; }
istream &operator>>(istream &i, __int128_t &x) { x=0; short f=1; char c=0; while(!isdigit(c)) { if(c=='-')f=-1; c=i.get(); } while(isdigit(c))x=x*10+c-'0', c=i.get(); x*=f; return i; }
ostream &operator<<(ostream &o, __int128_t x) { if(x==0) { o<<0; return o; } bool f=false; string s; if(x<0)f=true, x=-x; while(x)s+=x%10+'0', x/=10; reverse(s); if(f)o<<'-'; o<<s; return o; }
mt19937 mt(time(0));
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
constexpr int maxn=180+5;
constexpr int mod1=1'222'827'239;
constexpr int mod2=1'610'612'741;
constexpr int base=191;
constexpr int inf=0x3f3f3f3f;
constexpr ll INF=0x3f3f3f3f3f3f3f3fll;
constexpr double pi=acos(-1.0);
constexpr double eps=1e-9;
pll getHash(const vector<int> &vec)
{
	ll ans1=0, ans2=0;
	for(int x:vec)
	{
		ans1=(ans1*base+x)%mod1;
		ans2=(ans2*base+x)%mod2;
	}
	return make_pair(ans1, ans2);
}
int fact(int n)
{
	static const vector<int>fac{0, 1, 2, 6, 24, 120};
	if(n>fac.size())return inf;
	return fac[n];
}
vector<vector<int>>e;
vector<int>composition(const vector<int> &a, const vector<int> &b)
{
	if(!a.size())return b;
	vector<int>ans;
	for(int i=1; i<=a.size(); i++)
	{
		ans.push_back(a[b[i-1]-1]);
	}
	return ans;
}
/*
1 2
2 3
3 4
4 3
5 7
6 7
7 11


*/
constexpr int lim[]={0, 2, 3, 4, 3, 7, 7, 11};
int main()//MARK: main
{
#ifndef xxx
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
	cout<<fixed<<setprecision(10);
	int n, m;
	cin>>n>>m;
	for(int i=1; i<=m; i++)
	{
		vector<int>vec(n);
		for(int &x:vec)
		{
			cin>>x;
		}
		if(m>22)
		{
			if(count(e.begin(), e.end(), vec)<lim[n])
			{
				e.push_back(vec);
			}
		}
		else
		{
			e.push_back(vec);
		}
	}
	function<void(int, int, vector<int> &, map<vector<int>, bool> &)>dfs=[&](int step, int lim, vector<int> &now, map<vector<int>, bool> &mp)
	{
		if(step==lim+1)
		{
			if(now.size())
			{
				mp[now]=true;
			}
			return;
		}
		vector<int> nex=composition(now, e[step]);
		dfs(step+1, lim, nex, mp);
		dfs(step+1, lim, now, mp);
	};
	auto getans=[&]()->int
	{
		int ans=0;
		if(e.size()<=22)
		{
			map<vector<int>, bool>mp;
			vector<int>now;
			dfs(0, e.size()-1, now, mp);
			ans=mp.size();
		}
		else
		{
			map<vector<int>, bool>mp1, mp2, mp;
			vector<int>now1, now2;
			int mid=e.size()/2;
			dfs(0, mid, now1, mp1);
			dfs(mid+1, e.size()-1, now2, mp2);
			mp=mp1;
			for(auto &p:mp2)
			{
				mp.insert(p);
			}
			for(const auto &[a, f1]:mp1)
			{
				for(const auto &[b, f2]:mp2)
				{
					mp[composition(a, b)]=true;
				}
			}
			ans=mp.size();
		}
		return ans;
	};
	cout<<getans()<<'\n';
	return 0;
}