#include <bits/stdc++.h>
#define fep(A,B,C) for(int C=A;C>=B;--C)
#define rep(A,B,C) for(int C=A;C<=B;++C)
#define ll long long
#define sc(k) scanf("%d",&k)
#define put(A) printf("%d\n",A)
using namespace std;
const int MAXN=510;
#define int ll
int T,n;
int a[MAXN][10];
int k[10];
int mod[10];
char b[20010];
signed main()
{
	//freopen("1.in","r",stdin);
	sc(n);
	mod[1]=1000000000000000003;
	mod[2]=1000000000000001537;
	mod[3]=100000000000001459;
	mod[4]=1000000000000002493;
	mod[5]=100000000000001093;
	sc(T);
	rep(1,5,j)k[j]=1;
	rep(1,T,i)
	{
		rep(1,5,j)
		k[j]=((ll)k[j]*10)%mod[j];
	}
	rep(1,5,j)k[j]=(k[j]-1+mod[j])%mod[j];
	rep(1,n,ww)
	{
		scanf("%s",b+1);
		int len=strlen(b+1);
		rep(1,len,i)
		{
			rep(1,5,j)
			a[ww][j]=((ll)a[ww][j]*10+(b[i]-'0'))%mod[j];
		}
	}
	int ans=0;
	rep(1,n,i)rep(i,n,j)rep(j,n,K)
	{
		int flag=1;
		rep(1,5,cc)
		{
			if(k[j]==0)
			{
				if(((ll)a[i][cc]+a[j][cc]+a[K][cc])%mod[cc])
				{
					flag=0;break;
				}
			}
			else if(((ll)a[i][cc]+a[j][cc]+a[K][cc])%mod[cc]%k[j])
			{
				flag=0;
				break;
			}
		}
		ans+=flag;
	}
	put(ans);
	return 0;
}