#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 200;

int n, m, A[maxn][maxn], b[maxn], c[maxn], d[maxn];

namespace Sub1 {
	void solve() {
		set< vector<int> > S;
		for (int i = 1; i <= m; ++i) {
			auto T = S;
			for (auto &v : T) {
				for (int j = 0; j < n; ++j) {
					b[j + 1] = v[j];
				}
				for (int j = 1; j <= n; ++j) {
					c[j] = A[i][j];
				}
				vector<int> V;
				for (int j = 1; j <= n; ++j) {
					d[j] = b[c[j]];
					V.pb(d[j]);
				}
				S.insert(V);
			}
			vector<int> v;
			for (int j = 1; j <= n; ++j) {
				v.pb(A[i][j]);
			}
			S.insert(v);
		}
		printf("%d\n", (int)S.size());
	}
}


const int base=2371;
set<ull> mp;
int tmp[maxn],now[maxn];
namespace Sub2{
    void solve()
    {
        for(int S=1;S<(1<<m);S++)
        {
            for(int j=1;j<=n;j++)now[j]=j;
            for(int i=0;i<m;i++)
                if(S>>i&1)
                {
                    for(int j=1;j<=n;j++)tmp[j]=now[A[i + 1][j]];
                    for(int j=1;j<=n;j++)now[j]=tmp[j];
                }
            ull hsh=0;
            for(int i=1;i<=n;i++)hsh=(hsh*base+now[i]);
            if(mp.find(hsh)==mp.end())mp.insert(hsh);
        }
        printf("%d\n", (int)mp.size());
    }
}

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; ++i) {
		for (int j = 1; j <= n; ++j) {
			scanf("%d", &A[i][j]);
		}
	}
	if (m <= 18) {
		Sub2::solve();
	} else {
		Sub1::solve();
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}