#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=180+5,M=N*20+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,A[N][N];
namespace Solve1{
	vector<vector<int>> ans;
	int p[N],q[N];
	void dfs(int x,int w){
		if(x==n+1){
			vector<int> q(p+1,p+m+1);
			if(w) ans.emplace_back(q);return;
		}
		dfs(x+1,w);
		copy(p+1,p+m+1,q+1);
		for(int i=1;i<=m;i++) p[i]=q[A[x][i]];
		dfs(x+1,1);
		copy(p+1,p+m+1,q+1);
		for(int i=1;i<=m;i++) p[A[x][i]]=q[i];
	}
	void Solve(){
		iota(p+1,p+m+1,1);
		dfs(1,0);
		sort(ans.begin(),ans.end());
		int cnt=1;
		for(int i=1;i<ans.size();i++) cnt+=(ans[i]!=ans[i-1]);
		printf("%d\n",cnt);
	}
}
namespace Solve2{
	const int M=40320+5;
	int f[M],g[M];
	array<int,9> B[M],p;int H;
	void Solve(){
		int i,j,h;for(i=1;i<=m;i++) p[i]=i;
		do{
			B[++H]=p;
		}while(next_permutation(p.begin()+1,p.begin()+m+1));
		f[1]=1;
		for(i=1;i<=n;i++){
			Mc(g,f);
			for(j=1;j<=H;j++)if(g[j]){
				for(int h=1;h<=m;h++) p[h]=B[j][A[i][h]];
				int q=LB(B+1,B+H+1,p)-B;
				f[q]=min(f[q]+g[j],2);
			}
		}
		f[1]--;int cnt=0;for(i=1;i<=H;i++) cnt+=(f[i]>0);printf("%d\n",cnt);
	}
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);swap(n,m);
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) scanf("%d",&A[i][j]);
	if(n<=21) Solve1::Solve();
	else Solve2::Solve();
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}