#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define fixed(s) fixed<<setprecision(12)<<s
//#define int long long
 
using namespace std;
 
typedef pair<int, int> PII;
typedef long long ll;
typedef pair<ll, PII> PLII;

const int N = 200;

int n, m;
int a[N][N];
map<ll, int> st, poo;

void dfs(int pos, ll state)
{
	if(st.count(state) && poo.count(state) && poo[state] <= pos)return;
	poo[state] = pos;
	st[state] = 1;
	if(pos > n)return;
	
	vector<int> tmp(m + 1);
	ll t = state;
	for(int i = m; i >= 1; i --)
	{
		tmp[i] = t % (m + 1);
		t /= (m + 1);
	}
	
	for(int i = pos + 1; i <= n; i ++)
	{
		t = 0;
		for(int j = 1; j <= m; j ++)
		{
			t = t * (m + 1) + tmp[a[i][j]];
		}
		dfs(i, t);
	}
}

int main()
{
	IOS
	cin >> m >> n;
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
			cin >> a[i][j];
	
	if(n <= 17)
	{
		map<vector<int>, int> mp;
		
		for(int state = 1; state < (1 << n); state ++)
		{
			vector<int> tmp(m + 1);
			for(int j = 0; j < n; j ++)
			{
				if(state >> j & 1)
				{
					if(tmp[1] == 0)
					{
						for(int k = 1; k <= m; k ++)tmp[k] = a[j + 1][k];
						continue;
					}
					
					vector<int> tt(m + 1);
					for(int k = 1; k <= m; k ++)
					{
						tt[k] = tmp[a[j + 1][k]];
					}
					tmp = tt;
					//mp[tmp] = 1;
				}
			}
			mp[tmp] = 1;
		}
		
		cout << mp.size() << endl;
	}
	else// m <= 10
	{
		for(int i = 1; i <= n; i ++)
		{
			ll t = 0;
			for(int j = 1; j <= m; j ++)
			{
				t = t * (m + 1) + a[i][j];
			}
			dfs(i, t);
		}
		cout << st.size() << endl;
	}
	
	return 0;
}