#include<bits/stdc++.h>
using namespace std;
constexpr int mod0=998244353,mod1=19260817,mod2=1004535809;
constexpr int N=505,M=20005;
int n,k,m,ans,a[M];string s;
map<array<int,3>,int>mp;
array<int,3>ans0,ans1,ans2,Hash[N];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int rdc(int x,int mod){return x>=mod?x-mod:x;}
array<int,3> operator *(array<int,3>a,int x){
    return {(a[0]*10ll+x)%mod0,(a[1]*10ll+x)%mod1,(a[2]*10ll+x)%mod2};
}
array<int,3> operator +(array<int,3>a,array<int,3>b){
    return {rdc(a[0]+b[0],mod0),rdc(a[1]+b[1],mod1),rdc(a[2]+b[2],mod2)};
}
array<int,3> operator -(array<int,3>a,array<int,3>b){
    return {rdc(a[0]-b[0]+mod0,mod0),rdc(a[1]-b[1]+mod1,mod1),rdc(a[2]-b[2]+mod2,mod2)};
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>n>>k;
	for (int i=1;i<=n;i++){
		cin>>s;m=s.length();int head=0;
        for (int i=0;i<k;i++) a[i]=0;
        reverse(s.begin(),s.end()); 
		for (int i=0;i<m;i++) a[i%k]+=s[i]-'0';
        bool flag=1;
        while (flag){ flag=0;
            for (int i=0;i<k;i++)
                if (a[i]>9) flag=1,
                    a[i+1]+=a[i]/10,a[i]%=10;
            a[0]+=a[k];a[k]=0;
        } flag=1;
        for (int i=0;i<k;i++) flag&=a[i]==9;
        if (flag) continue;
        for (int j=k;~j;j--) Hash[i]=Hash[i]*a[j];
	}
    for (int i=0;i<k;i++) ans1=ans1*9,ans2=ans2*18;
    for (int i=1;i<=n;i++){
        mp[ans0-Hash[i]]++; mp[ans1-Hash[i]]++; mp[ans2-Hash[i]]++;
        for (int j=i;j<=n;j++) ans+=mp[Hash[i]+Hash[j]];
    }
    printf("%d\n",ans);
    return 0;
}