#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
long long n,m,o=0,A[8],D[8],E[N],G[N],Ans=0;
struct xty{
    int a[10];
    bool operator<(const xty &t)const{
        for(int i=1;i<=6;i++)if(a[i]!=t.a[i]&&E[i])return a[i]<t.a[i];
        return false;
    }
}B[N];
void Add_change(int x,int y){//,printf("*\n")printf("%d %d\n",x,y);for(int i=1;i<=6;i++)printf("%lld ",t.a[i]);printf(":%d %d\n",y,s);
    if(x>6){
        int s=0;
        sort(B+1,B+n+1);
        // for(int i=1;i<=o;i++)printf("%d ",G[i]);printf("\n");
        // for(int i=1;i<=n;i++){for(int j=1;j<=6;j++)printf("%d ",B[i].a[j]);printf("\n");};
        for(int i=2,z=1;i<=n;i++,z++){for(int j=1;j<=o;j++)if(B[i].a[G[j]]!=B[i+1].a[G[j]]){z=0;break;}A[y]+=z;}
        return;
    }
    Add_change(x+1,y);o++;G[o]=x;E[x]=1;Add_change(x+1,y+1);o--;E[x]=0;
}
int C(int x,int y){int s=1,v=1;for(int i=y-x+1,j=1;i<=y;i++,j++)s*=i,v*=j;return s/v;}
int main(){
    scanf("%lld %lld",&n,&m);
    for(int i=1;i<=n;i++){for(int j=1;j<=6;j++)scanf("%d",&B[i].a[j]);}
    Add_change(1,0);
    // for(int i=m,v=1,V=1;i<=6;i++,v=-v,V^=3)Ans+=A[i]*v*V;
    // Ans=A[m];for(int i=m+1,w=0;i<=6;i++){w=C(m,i);for(int j=m+1;j<i;j++)w-=C(j,i);Ans-=A[i]*w;}printf("%d %d %d %d\n",i,D[i],w,w*A[i]);
    Ans=A[m];for(long long i=6,w=0;i>m;i--){w=A[i]-D[i];for(int j=m+1;j<i;j++)D[j]+=C(j,i)*w;Ans-=C(m,i)*w;}
    // for(int i=0;i<=6;i++)printf("%lld ",A[i]);
    printf("%lld",Ans);
}