#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=20+2,S=1<<20;
int n,m,a[N][N],dp[N][N],lt[N][N],tp[N][N],vis[S],d[N],dt[N],vt[N],tim;
vector<pii>e[S];
vector<int>fr[N];
ll ans;
int main(){
	n=read(),m=read();
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			a[i][j]=read();
	int un=1<<n,um=1<<m;
	for(int i=0;i<m;i++)
		for(int j=i+1;j<m;j++){
			int s=0;
			for(int k=0;k<n;k++)
				if(a[k][i]<a[k][j])
					s|=1<<k;
			lt[i][j]=s;
		}
	for(int s=1;s<un;s++){
		vector<int>p,q;
		for(int i=0;i<n;i++)
			if(s>>i&1)
				p.push_back(i);
		q.push_back(0);
		for(int i=0;i<m;i++){
			bool fc=1,fd=1;
			for(int j=1;j<p.size();j++)
				fc&=a[p[j-1]][i]<a[p[j]][i],
				fd&=a[p[j-1]][i]>a[p[j]][i];
			if(fc||fd) q.push_back(i);
		}
		int t=q.size()-1;
		for(int i=0;i<=t;i++)
			for(int j=0;j<=t;j++)
				dp[i][j]=0;
		vector<int>ls;
		for(int i=1;i<=t;i++)
			for(int j=i+1;j<=t;j++)
				tp[i][j]=lt[q[i]][q[j]]&s,ls.push_back(tp[i][j]),e[tp[i][j]].push_back(mpr(i,j));
		for(auto c:ls){
			if(vis[c]==s) continue;
			vis[c]=s;
			tim++;
			vector<int>pt,ptt;
			for(auto tmp:e[c]){
				int u=tmp.fir,v=tmp.sec;
				fr[v].push_back(u),d[u]++;
				ptt.push_back(u),ptt.push_back(v);
			}
			for(int i:ptt)
				if(vt[i]!=tim)
					pt.push_back(i),vt[i]=tim;
			queue<int>q;
			for(int i:pt)
				if(!d[i])
					q.push(i);
			while(!q.empty()){
				int x=q.front();
				q.pop();
				ans+=dt[x],dt[x]++;
				for(auto t:fr[x]){
					dt[t]+=dt[x];
					if(!--d[t]) q.push(t);
				}
			}
			for(auto i:pt)
				fr[i].clear(),dt[i]=0,assert(!d[i]);
			vector<pii>rub;
			swap(e[c],rub);
		}
		ans+=t;
//		dp[0][0]=1;
//		for(int i=1;i<=t;i++)
//			for(int j=0;j<i;j++)
//				for(int k=0;!k||k<j;k++)
//					if(!k||tp[k][j]==tp[j][i]) dp[i][j]+=dp[j][k]; 
//		for(int i=1;i<=t;i++)
//			for(int j=0;j<i;j++)
//				ans+=dp[i][j];
	}
	write(ans);
	flush();
}