#pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
// #define int long long
#define i64 long long
#define pii pair <int, int> 
using namespace std;
inline int read(void) {
    int x=0,sgn=1; char ch=getchar();
    while(ch<48||57<ch) {if(ch==45)sgn=0;ch=getchar();}
    while(47<ch&&ch<58) {x=x*10+ch-48;   ch=getchar();}
    return sgn? x:-x;
}
void write(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
/*
    write((Ans%p+p)%p); pls
*/
const i64 mod=10000000000000061;
const i64 Mod=mod*2;
const i64 inv3=(mod+1)/3;
const i64 inv2=(mod+1)/2;
int n,k,Ans;
i64 M,MM;
map <i64,int> cnt;
int val[20004];
char buf[20004];
i64 a[1003];
inline bool check(i64 x) { return x==0||x==mod||x==Mod; }
signed main() {
    // freopen("localinput","r",stdin);
    // freopen("localoutput","w",stdout);
    n=read(); k=read();
    for(int i=1; i<=k; ++i) M=(10*M+9)%mod;
    MM=M*2%mod;
    for(int t=1; t<=n; ++t) {
        scanf("%s",buf);
        int m=strlen(buf);
        reverse(buf,buf+m);
        for(int i=0; i<k; ++i) val[i]=0;
        for(int i=0; i<m; ++i) val[i%k]+=buf[i]-'0';
        while(val[0]>9) {
            for(int i=0; i<k; ++i) val[i+1]+=val[i]/10,val[i]%=10;
            val[0]+=val[k]; val[k]=0;
        }
        i64 cur=0;
        for(int i=0; i<k; ++i) cur=(10*cur+val[i])%mod;
        cnt[cur]++;
        a[t]=cur;
    }
    Ans=cnt[0]*(cnt[0]+1)*(cnt[0]+2)/6;
    for(int i=1; i<=n; ++i)
        for(int u=i; u<=n; ++u)
            for(int j=u; j<=n; ++j)
                if(check(a[i]+a[u]+a[j]-M)||check(a[i]+a[u]+a[j]-MM))
                    ++Ans;
    write(Ans); puts("");
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}