#include <bits/stdc++.h>
using namespace std;
#define RN return
#define forw(_,l,r) for(auto _=(l);_<(r);++_)
void read(){}
template <typename T, typename...Types>
void read(T& a,Types&...args){
    a=0; char c=' ';
    while(isspace(c))c=getchar();
    while(isdigit(c))a=10*a+c-'0',c=getchar();
    read(args...);
}
typedef long long ll;
typedef __int128_t lll;
const ll MOD=1e9+7;
ll theta=97;
int n,m;
struct per{
    int lst[200];
    ll hash(){
        ll ans=0;
        forw(i,1,n+1)ans=(ll(ans)*theta+lst[i])%MOD;
        RN ans;
    }
    per operator*(per y){
        per ret;
        forw(i,1,n+1)ret.lst[i]=lst[y.lst[i]];
        RN ret;
    }
};
vector<per> vis; 
per lst[200];
set<ll> st0,st1;
void ins(per p){
    ll h=p.hash();
    // cout<<h<<endl;
    if(st0.find(h)==st0.end() && st1.find(h)==st1.end()){
        vis.push_back(p);
        st1.insert(h);
    }
}

int main(){
    read(n,m);

    forw(i,0,m){
        forw(j,1,n+1)read(lst[i].lst[j]);
        st1.clear();
        ins(lst[i]);
        for(auto& p: vis){
            if(st0.find(p.hash())!=st0.end())
                ins(p*lst[i]);
            else break;
        }
        for(auto h:st1)st0.insert(h);
        // cout<<vis.size()<<endl;
    }
    cout<<st0.size();
    // for(auto& p: vis){
    //     forw(i,1,n+1)cout<<p.lst[i]<<' ';
    //     cout<<p.hash()<<endl;
    // }
    RN 0;
}