#include <bits/stdc++.h>

using namespace std;

const int N = 4e5 + 10;
typedef long long ll;
map<int, int> mp1;
int mp2[N];

bool f[2][N];
int per[200][200];
int n, m;

int getP(int x) {
    int temp = 0;
    for (int i = 1; i <= n; i ++ ) {
        temp = temp * 10 + per[x][i];
    }
    return temp;
}

int getP(vector<int> &p) {
    int temp = 0;
    for (auto x: p) {
        temp = temp * 10 + x;
    }
    return temp;
}

void toPer(int x, vector<int> &t) {
    for (int i = 1; i <= n; i ++ ) {
        int r = x % 10;
        t.push_back(r);
        x /= 10;
    }
    reverse(t.begin(), t.end());
}

vector<ll>c;
set<string>ans;

inline string change(int a[],ll n)
{
    string s;
    s.resize(n);
    ll i;
    for(i=0;i<n;i++)s[i]=a[i+1];
    return s;
}
inline string solveans()
{
    ll k=c.size(),i,j;
    string ans=change(per[c[k-1]+1],n);
    for(i=k-2;i>=0;i--)
    {
        for(j=0;j<n;j++)ans[j]=per[c[i]+1][(int)ans[j]];
    }
    return ans;
}

inline void dfs(ll x,ll cnt)
{
    if(cnt)ans.insert(solveans());
    if(cnt>=m)return;
    ll i;
    for(i=x;i<m;i++)
    {
        c.emplace_back(i);
        dfs(i+1,cnt+1);
        c.pop_back();
    }
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= m; i ++ ) {
        for (int j = 1; j <= n; j ++ ) cin >> per[i][j];
    }
    if(m<=20)
    {
        dfs(0,0);
        cout<<ans.size()<<'\n';
        exit(0);
    }
    int a[20];
    for (int i = 1; i <= n; i ++ ) a[i] = i;
    int cnt = 0;
    do {
        int temp = 0;
        for (int i = 1; i <= n; i ++ ) {
            temp = temp * 10 + a[i];
        }
        mp1[temp] = ++ cnt;
        mp2[cnt] = temp;
    } while (next_permutation(a + 1, a + n + 1));

    f[1][mp1[getP(1)]] = 1;
    for (int i = 2; i <= m; i ++ ) {
        int p2 = getP(i);
        int t = i & 1;
        int t2 = mp1[p2];
        // printf("p2:%d t:%d\n", p2, t);
        for (int j = 1; j <= cnt; j ++ ) {
            f[t][j] = f[t ^ 1][j];
        }
        for (int j = 1; j <= cnt; j ++ ) {
            int t1 = j, p1 = mp2[j];
            vector<int> pp1, pp2, pp3;
            toPer(p1, pp1), toPer(p2, pp2);
            for (auto x: pp2) {
                pp3.push_back(pp1[x - 1]);
            }
            int p3 = getP(pp3);
            int t3 = mp1[p3];
            // printf("p1:%d p2:%d p3:%d\n", p1, p2, p3);
            // printf("t1:%d t2:%d t3:%d\n", t1, t2, t3);
            f[t][t3] |= f[t^1][t3] | f[t ^ 1][t1];
            // printf("f[%d][%d] = %d\n", t, t3, f[t][t3]);
        }
        f[t][t2] = 1;
    }

    int t = m & 1, ans = 0;
    // cout << "f:\n";
    for (int i = 1; i <= cnt; i ++ ) {
        // cout << f[t][i] << " ";
        if (f[t][i]) ans ++;
    }
    // cout << endl;

    cout << ans << endl;
}