#include<cstdio>
#include<iostream>
#include<cstring>
#define RI register int
#define CI const int&
using namespace std;
const int N=20005;
const int mod1=998244353,mod2=1e9+7,mod3=1e9+9;
struct Hasher
{
    int x,y,z;
    inline Hasher(CI X=0,CI Y=0,CI Z=0)
    {
        x=X; y=Y; z=Z;
    }
    friend inline bool operator == (const Hasher& A,const Hasher& B)
    {
        return A.x==B.x&&A.y==B.y&&A.z==B.z;
    }
    friend inline Hasher operator + (const Hasher& A,const Hasher& B)
    {
        return Hasher((A.x+B.x)%mod1,(A.y+B.y)%mod2,(A.z+B.z)%mod3);
    }
    friend inline Hasher operator - (const Hasher& A,const Hasher& B)
    {
        return Hasher((A.x-B.x+mod1)%mod1,(A.y-B.y+mod2)%mod2,(A.z-B.z+mod3)%mod3);
    }
    friend inline Hasher operator * (const Hasher& A,const Hasher& B)
    {
        return Hasher(1LL*A.x*B.x%mod1,1LL*A.y*B.y%mod2,1LL*A.z*B.z%mod3);
    }
}h[N],tar1,tar2,tar3;
const Hasher seed=Hasher(10,10,10);
int n,k,num[N*2]; char s[N];
int main()
{
    scanf("%d%d",&n,&k);
    for (RI l=1;l<=n;++l)
    {
        scanf("%s",s+1); int m=strlen(s+1);
        for (RI i=1;i<=m;++i) num[i]=s[m-i+1]-'0';
        int rm=(m+k-1)/k*k;
        for (RI i=m+1;i<=rm;++i) num[i]=0;
        for (RI i=rm/k-1;i>=1;--i)
        {
            for (RI j=(i-1)*k+1;j<=i*k;++j)
            {
                num[j]+=num[j+k];
                num[j+1]+=num[j]/10;
                num[j]%=10;
            }
        }
        for (RI i=k;i>=1;--i)
        h[l]=h[l]*seed+Hasher(num[i],num[i],num[i]);
        //printf("h[%d] = %d\n",l,h[l].x);
    }
    for (RI i=1;i<=k;++i) tar2=tar2*seed+Hasher(9,9,9);
    tar3=tar2*Hasher(2,2,2); tar1=Hasher(0,0,0);
    int ans=0;
    for (RI a=1;a<=n;++a)
    for (RI b=a;b<=n;++b)
    for (RI c=b;c<=n;++c)
    {
        Hasher tmp=h[a]+h[b]+h[c];
        ans+=(tmp==tar1||tmp==tar2||tmp==tar3);
    }
    return printf("%d",ans),0;
}