#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back

typedef long long ll;
typedef pair <int,int> pii;

const int N = 185;
const int MAX_FACT = 362885;

int n, m;
vector <int> perm[N];
unordered_map <string, int> mp;
set <int> s;

bool vis[MAX_FACT][N];
void get_cant (int id_perm, int ind, string str ) {
    s.insert ( id_perm );
    if ( ind < 0 ) return;
    if ( vis[id_perm][ind] ) return;
    vis[id_perm][ind] = true;
    get_cant ( id_perm, ind-1, str );
    for ( int i = 0; i < n; ++i )
        str[i] = perm[ind][str[i]-'1']+'0';
    id_perm = mp[str];
    get_cant ( id_perm, ind-1, str );
    return;
}

int checkPerm () {
    string bas_perm = "";
    for ( int i = 1; i <= n; ++i )
        bas_perm.pb ( i + '0' );
    int it = 0;
    do {
        mp[bas_perm] = it++;
    } while ( next_permutation ( bas_perm.begin(), bas_perm.end() ) );
    get_cant ( it, m-1, bas_perm );
    return s.size() - 1;
}

unordered_set <string> us;
int checkSubsets () {
    vector <int> curr_p ( n );
    for ( int mask = 1; mask < (1 << m); ++mask ) {
        for ( int i = 0; i < n; ++i )
            curr_p[i] = i+1;
        for ( int j = m-1; j >= 0; --j ) {
            if ( !((mask>>j)&1) ) continue;
            for ( int i = 0; i < n; ++i )
                curr_p[i] = perm[j][curr_p[i]-1];
        }
        string curr_str = "";
        for ( int i = 0; i < n; ++i )
            curr_str += curr_p[i] + '0';
        us.insert ( curr_str );
    }
    return us.size();
}

int main () {
        
    #ifndef LOCAL
    #endif

    scanf ( "%d%d", &n, &m );
    for ( int i = 0; i < m; ++i ) {
        for ( int h = 0; h < n; ++h ) {
            int curr;
            scanf ( "%d", &curr );
            perm[i].pb ( curr );
        }
    }

    int res;
    if ( n <= 9 ) {
        res = checkPerm ();
    } else {
        res = checkSubsets ();
    }
    printf ( "%d\n", res );

    return 0;
}