#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 200,mod = 1e9+7;
const int M1 = 1e9 + 7, M2 = 20071211, base = 1e9 + 9;
void add(ll& x,ll y){x = (x+y)%mod;}

int n,m,a[MAXN][MAXN];

namespace T1{
	set<pair <int, int>> f;
	int p[MAXN],q[MAXN];//,tmp[30][MAXN];

	void dfs(int r,int tag){
		if(r==n+1){
			if(!tag)return;
			int h1 = 0, h2 = 0;
			rep(i,1,m){
				h1 = ((ll) h1 * base + p[i]) % M1;
				h2 = ((ll) h2 * base + p[i]) % M2;
				// h = ((ll) h * base + p[i]) % M3;
			}
			f.emplace(h1, h2);
			return;
		}
		dfs(r+1,tag);
		int tmp[m + 5];
		rep(i,1,m)q[i] = a[r][p[i]],tmp[i] = p[i];

		rep(i,1,m)p[i] = q[i];
		dfs(r+1,1);
		rep(i,1,m)p[i] = tmp[i];
	}

	void solve(){
		rep(i,1,m)p[i] = i;
		dfs(1,0);

		cout<<f.size()<<"\n";
	}
};	
#define debug cerr << "[" << __LINE__ << "] "
namespace T2{
	const int MAXM = 20,MAXL = 4e5+10;
	ll fac[MAXM],vis[MAXM],q[MAXM];

	bitset<MAXL>dp[200];
	int p[MAXM];

	int calc(){
		int sum = 0;
		rep(i,1,m)rep(j,i + 1,m)if(q[j]<q[i])sum += fac[m-i];
		return sum;
	}

	void solve(){
		fac[0] = 1;rep(i,1,m)fac[i] = fac[i-1] * i;
		ll A = fac[m];

		per(i,n,1){
			dp[i] |= dp[i+1];
		
			rep(j,1,m)q[j] = a[i][j];
			int h = calc();
			// debug << i << " " << h << endl;
			assert(h<A);
			dp[i][h] = 1;

			rep(j,0,A-1)if(dp[i+1][j]){
				ll num = j;
				fill(vis+1,vis+1+m,1);
				// debug << j << endl;
				rep(k,1,m){
					int rk = num / fac[m-k];
					// debug << k << " " << rk << endl;
					rep(val,1,m)if(vis[val]){
						if(!rk){
							p[k] = val;
							vis[val] = 0;
							break;
						}
						rk--;
					}
					num %= fac[m-k];
				}
				rep(k,1,m)q[k] = a[i][p[k]];
				int h = calc();
				assert(h<A);
				dp[i][h] = 1;
			}
		}

		cout<<dp[1].count()<<"\n";
	}		
};

int main(){
	cin>>m>>n;
	rep(i,1,n){
		rep(j,1,m){
			int v;cin>>v;
			a[i][v] = j;
		}
	}
	
	if(n <= 20){
		T1::solve();
	}else{
		T2::solve();
	}
    return 0;
}