// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops",
// "omit-frame-pointer", "inline") #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
// #pragma GCC option("arch=native", "no-zero-upper") // Enable AVX

/// UH Top
#include <bits/stdc++.h>
#define db(x)   cerr << #x << ':' << (x) << '\n';
#define all(v)  (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
 #define int ll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
// typedef __int128_t int128;
typedef pair<ll, ll> pii;
typedef pair<ld, ll> pdi;
typedef pair<ld, ld> pdd;
typedef pair<ld, pdd> pdp;
typedef pair<string, ll> psi;
typedef pair<ll, string> pls;
typedef pair<string, string> pss;
typedef pair<ll, pii> pip;
typedef pair<pii, pii> ppp;
typedef complex<ld> point;
typedef vector<point> polygon;
typedef vector<ll> vi;
typedef pair<point, int> ppi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
#define prec(n)                                                                \
	cout.precision(n);                                                         \
	cout << fixed
const ll mod = (1e9 + 7);
const ld eps = (1e-9);
const ll oo = (ll)(1e18 + 5);
#define pi   acos(-1)
#define MAXN (ll)(1e6 + 5)
#define fs first
#define sc second
#define mid (L+R)/2
#define pb push_back
#define sz(x) (int)((x).size())

int n,m;

vi multiply(const vi& A,const vi&B){
	vi Ans(m);
	for(int i=0;i<m;i++)Ans[i]=A[B[i]];
	return Ans;
}

int solveDp(vvi A){
	set<vi> S;
	for(auto &a:A){
		vvi Ne;
		Ne.reserve(44444);
		for(auto v:S){
			Ne.pb(multiply(v,a));
		}
		Ne.pb(a);
		for(auto f:Ne){
			S.insert(f);
		}
	}
	return sz(S);
}
int solveBitmask(vvi A){
	vector<vector<int>> Dp(1<<n);
	set<vi> S;
	for(int i=0;i<n;i++){
		Dp[1<<i]=A[i];
	}
	for(int i=1;i<(1<<n);i++){
		int d=__builtin_ctz(i);
		if((1<<d)!=i){
			Dp[i]=multiply(Dp[(1<<d)],Dp[i^(1<<d)]);
		}
		S.insert(Dp[i]);
		// cout<<i<<'\n';
		// for(auto a:Dp[i]){
		// 	cout<<a<<" ";
		// }
		// cout<<"\n";
	}
	return sz(S);
}

void problem(){
	cin>>m>>n;	
	vvi A(n,vi(m));
	for(int i=0;i<n;i++){
		for(auto &a:A[i]){cin>>a;a--;}
	}
	if(n<=20){
		cout<<solveBitmask(A);
	}else{
		cout<<solveDp(A);
	}


}


int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int tc=1;
	//cin>>tc;
	while(tc--){
		problem();
	}

	return 0;
}