#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n,K;
#define M 505
#define N 100005
char A[M][N];
const ll P = 1e17+19;
ll B[M];
int cnt = 0;
int tmp[M];
int main(){
    cin>>n>>K;
    for(int i=1;i<=n;i++){
        scanf("%s",A[i]+1);
        int len = strlen(A[i] + 1);
        reverse(A[i]+1,A[i]+1+len);
        for(int j=1;j<=K+1;j++)tmp[j]=0;
        for(int j=1;j<=len;j+=K){
            for(int k=1;k<=K;k++){
                int v = tmp[k] + (j+k-1 > len ? 0 : (int)(A[i][j+k-1]-'0'));
                tmp[k] = v%10;
                tmp[k+1] += v/10;
            }
            while(tmp[K+1]){
                assert(tmp[K+1] == 1);
                tmp[K+1] = 0;
                int k=1;
                for(;k<=K && tmp[k]==9;k++)
                    tmp[k] = 0;
                tmp[k]++;
            }
        }
        int flg = 1;
        for(int j=1;flg && j<=K;j++)
            if(tmp[j] != 0)flg = 0;
        cnt += flg;
        for(int j=K;j>=1;j--)
            B[i] = (10*B[i]+tmp[j])%P;
    }
    int a=0,b=0;
    for(int i=1;i<=K;i++)
        a=(10ll*a+9)%P;
    b=2*a%P;
    unordered_map<ll,int> pos;
    ll ans = 1ll*(cnt+2)*(cnt+1)*cnt/6;
    for(int i=n;i>=1;i--){
        pos[B[i]]++;
        for(int j=i;j>=1;j--){
            ans += pos[(P+P+a-B[i]-B[j])%P];
            ans += pos[(P+P+b-B[i]-B[j])%P];
        }
    }
    cout<<ans<<endl;
    return 0;
}