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

int main()
{
    int n,k;
    cin>>n>>k;
    map<pair<int,int>,int> mp;
    int idx=0;
    vector<int> rootv;
    for(int i=1;i<=n;i++)
    {
        vector<int> a(k+5),dp(k+5),lson(k+5),rson(k+5);
        auto ins=[&](auto &&self,int cur,int pos)->void
        {
            if(a[pos]<a[cur])
            {
                if(not lson[cur]){lson[cur]=pos;return;}
                self(self,lson[cur],pos);
            }
            else
            {
                if(not rson[cur]){rson[cur]=pos;return;}
                self(self,rson[cur],pos);
            }
        };
        for(int j=1;j<=k;j++)
        {
            cin>>a[j];
            if(j!=1)ins(ins,1,j);
        }
        auto dfs=[&](auto &&self,int u)->void
        {
            if(lson[u])self(self,lson[u]);
            if(rson[u])self(self,rson[u]);
            if(not mp.contains(make_pair(lson[u],rson[u])))
            {
                mp[make_pair(lson[u],rson[u])]=++idx;
            }
            dp[u]=mp[make_pair(lson[u],rson[u])];
        };
        dfs(dfs,1);
        rootv.push_back(dp[1]);
    }
    sort(rootv.begin(),rootv.end());
    cout<<unique(rootv.begin(),rootv.end())-rootv.begin()<<endl;
    return 0;
}