// Problem: K. Randias Permutation Task
// Contest: undefined - The 2nd Universal Cup. Stage 8: Guilin
// URL: https://qoj.ac/contest/1404/problem/7687
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
#define repn(i, n) for (int i = 1; i <= (int)n; i++)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repr(i, m, n) for (int i = (int)m; i <= (int)n; i++)
#define repd(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#ifdef LILYWHITE
#define eprintf(...)                  \
    {                                 \
        fprintf(stderr, __VA_ARGS__); \
        fflush(stderr);               \
    }
#else
#define eprintf(...) ;
#endif
const int __attribute__((unused)) INF = 0x3f3f3f3f;
template <typename T>
inline T rd(T &x) {
    x = 0;
    T neg = 1;
    char c = 0;
    while (c < '0' || c > '9') {
        if (c == '-') neg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - 48;
        c = getchar();
    }
    x *= neg;
    return x;
}
template <typename T, typename... Args>
inline void rd(T &x, Args &...args) {
    rd(x);
    rd(args...);
}
#define MAXN 500100
int n, m, d[20], b[20], a[220][220];
int c[MAXN], cntc;
map<int, int> flag;
namespace Small {
int solve(int u, int id) {
    for (int i = n; i >= 1; i--) {
        b[i] = u % 10;
        u /= 10;
    }
    for (int i = 1; i <= n; i++) {
        d[i] = b[a[id][i]];
    }
    u = 0;
    for (int i = 1; i <= n; i++) u = u * 10 + d[i];
    return u;
}
void Main() {
    int u, v;
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
    }
    for (int i = 1; i <= m; i++) {
        if (cntc) {
            v = cntc;
            for (int j = 1; j <= v; j++) {
                u = solve(c[j], i);
                if (flag[u] == 0) {
                    c[++cntc] = u;
                    flag[u] = 1;
                }
            }
        }
        u = 0;
        for (int j = 1; j <= n; j++) u = u * 10 + a[i][j];
        if (flag[u] == 0) {
            c[++cntc] = u;
            flag[u] = 1;
        }
    }
    printf("%d\n", cntc);
}
}  // namespace Small
namespace Large {
const int N = 30;
vector<int> a[N];
vector<int> solve(const vector<int> &lhs, const vector<int> &rhs) {
    vector<int> result(n);
    for (int i = 0; i < n; i++) {
        result[i] = lhs[rhs[i]];
    }
    return result;
}
void Main() {
    for (int i = 0; i < m; i++) {
        a[i].resize(n);
        rep(j, n) {
            rd(a[i][j]);
            --a[i][j];
        }
    }
    set<vector<int>> seen;
    for (int i = 1; i < (1 << m); i++) {
        eprintf("%d: \n", i);
        vector<int> perms;
        for (int j = 0; j < m; j++) {
            if ((1 << j) & i) perms.push_back(j);
        }
        auto x = a[perms[0]];
        eprintf("perms: ");
        for (auto x : perms) eprintf("%d ", x);
        eprintf("\n");
        repr(j, 1, perms.size() - 1) {
            x = solve(x, a[perms[j]]);
            for (auto u : x) eprintf("%d ", u);
            eprintf("\n");
        }
        if (!seen.count(x)) {
            seen.insert(x);
            for (auto u : x) eprintf("%d ", u);
            eprintf("\n");
        }
    }
    cout << seen.size() << endl;
}
}  // namespace Large
int main() {
    scanf("%d%d", &n, &m);
    if (n >= 9)
        Large::Main();
    else
        Small::Main();
    return 0;
}