/*
    author:  Maksim1744
    created: 04.11.2023 14:47:38
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int n, m;
    cin >> m >> n;
    vector<vector<int>> p(n, vector<int>(m));
    cin >> p;
    --p;
    reverse(p.begin(), p.end());
    if (n <= 20) {
        vector<vector<int>> pmask(1 << n);
        pmask[0].resize(m);
        for (int i = 0; i < m; ++i) {
            pmask[0][i] = i;
        }
        for (int i = 1; i < pmask.size(); ++i) {
            int b = n - 1;
            while (((i >> b) & 1) == 0) --b;
            const auto& prev = pmask[i ^ (1 << b)];
            auto& res = pmask[i];
            res.resize(m);
            for (int j = 0; j < m; ++j) {
                res[j] = p[b][prev[j]];
            }
        }
        pmask.erase(pmask.begin());
        sort(pmask.begin(), pmask.end());
        pmask.erase(unique(pmask.begin(), pmask.end()), pmask.end());
        cout << pmask.size() << '\n';
    } else {
        assert(m <= 9);
        vector<vector<int>> cur;
        vector<vector<int>> nx;
        for (const auto& perm : p) {
            nx.assign(cur.begin(), cur.end());
            nx.pb(perm);
            for (const auto& p : cur) {
                vector<int> p1(p.size());
                for (int i = 0; i < m; ++i) {
                    p1[i] = perm[p[i]];
                }
                nx.pb(p1);
            }
            sort(nx.begin(), nx.end());
            nx.erase(unique(nx.begin(), nx.end()), nx.end());
            swap(cur, nx);
        }
        cout << cur.size() << '\n';
    }

    return 0;
}