int rep(vector<int> &pos,int j) {
    int temp=0;
    int p=j;
    while(p+1) {
        ++temp;
        p=pos[p];
        if(p-j) 
        continue;
        else
        return temp;
    }
    return -1;
}
void solve() {
    int n; cin>>n;
    string str; cin>>str;
    vector<int> pos(26,-1);
    int ref[26];
    for(int i=0; i<26; i++) 
        pos[i]=-1,ref[i]=1;
    for(int i=0; i<n; i++) {
        if(pos[str[i]-'a']==-1)  {
            for(int j=0; j<26; j++) {
                if(ref[j] and j!=str[i]-'a') {
                    pos[str[i]-'a']=j;
                    int z=rep(pos,j);
                    if(z!=-1 and z!=26)
                    continue;
                    else {
                        ref[j]=0;
                        break;
                    }
                }
            }
        }
        cout<<char(pos[str[i]-'a']+'a');
    }

n,k=list(map(int,input().split())) 
p,q=[{},{}] 
a,b,c,s=[[0]*10000,[0]*1001,[0]*1001,0] 
for i in range(1,n+1): 
    d=0 
    a[i]=list(map(int,input().split())) 
    for j in range(0,k): 
        d=d*3+a[i][j] 
    if not d in p: 
        p[d]=1 
    else: 
        p[d]=p[d]+1 
    b[i]=d 
for i in range(1,n): 
    for j in range(i+1,n+1): 
        d=0 
        for l in range(0,k): 
            d*=3 
            if a[i][l]==a[j][l]: 
                d+=a[i][l] 
            else: 
                d+=3-a[i][l]-a[j][l] 
        if not d in p: 
            continue; 
        t=p[d] 
        if not b[i] in q: 
            q[b[i]]=t 
        else: 
            q[b[i]]+=t 
        if not b[j] in q: 
            q[b[j]]=t 
        else: 
            q[b[j]]+=t 
        if not d in q: 
            q[d]=t 
        else: 
            q[d]+=t 
for i in q: 
    s+=q[i]//3*(q[i]//3-1)//2 
print(s)

https://codeforces.com/contest/1735/submission/174413565