#include<bits/stdc++.h>
using namespace std;
const unsigned long long MOD1=((long long)(1e18))+3;
const unsigned long long MOD2=((long long)(1e18))+9;
char s[20010];
unsigned long long p[20010],pmod;
unsigned long long num1[510],num2[510];
long long n,k,ans;
inline void func()
{
	long long i;
	unsigned long long lasnum=0;
	for(i=0;i<k;++i)
		p[i]+=lasnum,lasnum=p[i]/10,p[i]%=10;
	p[0]+=lasnum;
	return;
}
inline void read(long long id)
{
	if(k<=15)
	{
		unsigned long long s=0;
		char ch=getchar();
		while(ch>'9'||ch<'0')
			ch=getchar();
		while(ch<='9'&&ch>='0')
		{
			s=(s*10+ch-48)%pmod;
			ch=getchar();
		}
		num1[id]=s,num2[id]=s;
	}
	else
	{
		long long i,len,vis=0;
		scanf("%s",s+1);
		len=strlen(s+1);
		for(i=len;i>=1;--i)
			p[(len-i)%k]+=(s[i]-'0');
		func();
		func();
		func();
		for(i=0;i<k;++i)
		{
			if(p[i]!=9)
			{
				vis=1;
				break;
			}
		}
		if(!vis)
		{
			num1[id]=0,num2[id]=0;
			for(i=0;i<k;++i)
				p[i]=0;
		}
		else
		{
			for(i=k-1;i>=0;--i)
			{
				num1[id]=(num1[id]*10+p[i])%MOD1,num2[id]=(num2[id]*10+p[i])%MOD2;
				p[i]=0;
			}
		}
	}
	return;
}
int main()
{
	long long i,j,l;
	unsigned long long s1=0,s2=0,s3,s4;
	scanf("%lld %lld",&n,&k);
	for(i=1;i<=k;++i)
		s1=(s1*10+9)%MOD1,s2=(s2*10+9)%MOD2;
	if(k<=15)
		pmod=s1;
	for(i=1;i<=n;++i)
	{
		read(i);
		//printf("??? %llu %llu %llu %llu\n",num1[i],num2[i],s1,s2);
	}
	s3=s1*2%MOD1,s4=s2*2%MOD2;
	for(i=1;i<=n;++i)
		for(j=i;j<=n;++j)
			for(l=j;l<=n;++l)
			{
				if(((num1[i]+num1[j]+num1[l])%MOD1==s1&&(num2[i]+num2[j]+num2[l])%MOD2==s2)||((num1[i]+num1[j]+num1[l])%MOD1==s3&&(num2[i]+num2[j]+num2[l])%MOD2==s4)||((num1[i]+num1[j]+num1[l])%MOD1==0&&(num2[i]+num2[j]+num2[l])%MOD2==0))
					++ans;
			}
	printf("%lld",ans);
	return 0;
}
/*
3 20
99999999999999999999
89999999999999999999
10000000000000000000
*/