#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=505;
const int mod[5]={998244353,(int)1e9+7,(int)1e9+9,19260817,2147483647};
ll ha[N][5],Ha[5],Ha2[5];
char s[200005];
int a[N][20005];
int n,d;
void gjd(int x)
{
	for (int i=0;i<d;++i)
	{
		a[x][i+1]+=a[x][i]/10;
		a[x][i]%=10;
	}
}
int main()
{
	scanf("%d%d",&n,&d);
	for (int i=1;i<=n;++i)
	{
		scanf("%s",s);
		int p=0,m=strlen(s);
		for (int j=m-1;j>=0;--j)
		{
			a[i][p]+=s[j]-'0';
			++p;
			if (p==d)
				p=0;
		}
		gjd(i);
		while (a[i][d]!=0)
		{
			a[i][0]+=a[i][d];
			a[i][d]=0;
			gjd(i);
		}
		bool b=true;
		for (int j=0;j<d;++j)
			if (a[i][j]!=9)
				b=false;
		if (b)
		{
			for (int j=0;j<d;++j)
				a[i][j]=0;
		}
		for (int j=0;j<5;++j)
			// for (int k=0;k<d;++k)
			for (int k=d-1;k>=0;--k)
				ha[i][j]=((ll)ha[i][j]*10+a[i][k])%mod[j];
	}
	for (int i=0;i<5;++i)
	{
		for (int j=0;j<d;++j)
			Ha[i]=((ll)Ha[i]*10+9)%mod[i];
		Ha2[i]=((ll)Ha[i]*2)%mod[i];
	}
	int ans=0;
	for (int i=1;i<=n;++i)
		for (int j=i;j<=n;++j)
			for (int k=j;k<=n;++k)
			{
				int b=1;
				for (int l=0;l<5;++l)
				{
					ll tmp=(ha[i][l]+ha[j][l]+ha[k][l])%mod[l];
					if (tmp!=0&&tmp!=Ha[l]&&tmp!=Ha2[l])
					{
						b=0;
						break;
					}
				}
				ans+=b;
			}
	cout<<ans<<endl;
	return 0;
}