#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N=1e05+10;
const LL mod=1e09+7;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >t;
priority_queue<LL> q;
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
void merge(vector<int> a , vector<int>b , vector<int>&c){
	for(int i = 0 ; i < n ; i ++){
		c[i] = a[b[i]];
	}
}
void solve() 
{	
	cin >> n >> m;
	vector<int>v[m];
	map< vector<int> , int>mp;
	int out = 0;
	for(int i = 0 ; i < m ; i++){
		for(int j = 0 ; j < n ; j ++){
			int x;
			cin>>x;
			v[i].pb(x);
		}
	}
	vector< vector<int> > ans;
	ans.pb(v[0]);
	mp[v[0]] = 1;
	for(int i = 1 ; i < m ; i ++){
		int len = ans.size();
		for(int j = 0 ; j < len ; j ++){
			vector<int> neww;
			for(int k = 0 ; k < n ; k ++){
				neww.pb(ans[j][v[i][k]]);
			}
			if(mp[neww] == 0){
				ans.pb(neww);
				mp[neww]++;
			}
		}
	}
	cout<<ans.size();
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
//	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}