/*
Problem : M. 3 Sum
Url : https://qoj.ac/contest/1540/problem/8340
Date : 2024/11/7 18:55:03
Solver : pmt2018
*/

#include<bits/stdc++.h>
#include <bits/extc++.h>

#define y0 pmtx
#define y1 pmtxx
#define x0 pmtxxx
#define x1 pmtxxxx
#define pb push_back
#define mp make_pair
#define fi first 
#define se second
#define lowbit(x) (x&(-x))

#define DEBUG printf("Passing Line %d in function [%s].\n",__LINE__,__FUNCTION__)

using namespace std;
using namespace __gnu_pbds;

typedef pair<int ,int > pii;
typedef vector<int > vi;
typedef long long ll;
typedef unsigned long long ull;

namespace FastIO{
    const int SIZE=(1<<20);
    char in[SIZE],*inS=in,*inT=in+SIZE;
    inline char Getchar(){
        if(inS==inT){inT=(inS=in)+fread(in,1,SIZE,stdin);if(inS==inT)return EOF;}
        return *inS++;
    }
    char out[SIZE],*outS=out,*outT=out+SIZE;
    inline void Flush(){fwrite(out,1,outS-out,stdout);outS=out;}
    inline void Putchar(char c){*outS++=c;if(outS==outT)Flush();}
    struct NTR{~NTR(){Flush();}}ZTR;
}

#ifndef LOCAL
    #define getchar FastIO::Getchar
    #define putchar FastIO::Putchar 
#endif

template<typename T> inline void read(T &x){
    x=0;int f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    x*=f;
}

inline void readstr(char* str){
    int len=0;char c=getchar();
    while(c==' '||c=='\n')c=getchar();
    while(c!=' '&&c!='\n'&&c!='\r')str[len++]=c,c=getchar();
    str[len] = '\0';
}

template<typename T>inline void write(T x){
    if(!x)putchar('0');
    if(x<0)x=-x,putchar('-');
    static int sta[20];int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}

inline void writestr(char* str){int cur=0;while(str[cur])putchar(str[cur++]);}

const int maxn=200007,INF=0x3f3f3f3f;
const ll MOD=998244353;
const ll LINF=0x3f3f3f3f3f3f3f3fll;
const ll P=19260817;

template<typename T>inline void ckmax(T &x,T y){x=(y>x?y:x);}
template<typename T>inline void ckmin(T &x,T y){x=(y<x?y:x);}
template<typename T>inline T my_abs(T x){if(x<0)x=-x;return x;}
// inline int mod1(int x){return x<MOD?x:x-MOD;}
// inline int mod2(int x){return x<0?x+MOD:x;}
// inline void add(int &x,int y){x=mod1(x+y);}
// inline void sub(int &x,int y){x=mod2(x-y);}

int n, K;

pii h[maxn];
char s[maxn];
int num[maxn];

const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;


// typedef uint64_t ull;
mt19937_64 rnd(time(nullptr));
const ull mask = rnd();
const ull base = rnd();
ull xorshift(ull x) {
	x ^= mask;
	x ^= x << 13;
	x ^= x >> 7;
	x ^= x << 17;
	x ^= mask;
	return x;
}
inline ull key(int ai, int bi) {
    return xorshift(((1ull * ai) << 32) | (1ull * bi)); 
}
gp_hash_table <ull, int> vis; 

pii solve(){
    int l = strlen(s + 1);
    // cout<<l<<endl;
    if(l==1&&s[1] == '0')return mp(0,0);
    for(int i = l; i >= 1; i--) {
        num[l-i]=s[i]-'0';
    }

    while(true) {
        for(int i = K; i < l; i++) {
            num[i%K] += num[i];
            num[i] = 0;
        }
        for(int i = 0; i < K; i++) {
            num[i + 1] += num[i] / 10; 
            num[i] %= 10;
        }
        for(l = K; num[l] != 0; l ++){
            num[l + 1] += num[l] / 10; 
            num[l] %= 10;
        }
        // cout<<l<<endl;
        if(l <= K) break;
    }
    bool all9 = 1;
    for(int i = 0; i < K; i++){
        if(num[i]!=9)all9=0;
    }
    if(all9)for(int i=0;i<K;i++)num[i]=0;
    // int pw1 = 1, pw2 = 1;
    int ans1 = 0, ans2 = 0;
    for(int i = K - 1; i >= 0; i--) {
        ans1 = (10ll * ans1 % mod1 + num[i]) % mod1;
        ans2 = (10ll * ans2 % mod2 + num[i]) % mod2;
    }
    
    for(int i = 0; i < l; i++)num[i] = 0;
    // cout<<ans1<<' '<<ans2<<endl;
    return mp(ans1, ans2);
}

int main(){
#ifdef LOCAL
    // freopen(".in","r",stdin);
    // freopen(".in","w",stdout);
#else
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
#endif
    scanf("%d%d", &n, &K);
    for(int i=1;i<=n;i++){
        // readstr(s + 1);
        scanf("%s", s + 1);
        h[i] = solve();
    }

    pii M, M2;
    M.fi = M.se = 1;
    for(int i = 1; i <= K; i++) {
        M.fi = 10ll * M.fi % mod1;
        M.se = 10ll * M.se % mod2;
    }
    M.fi = (M.fi - 1ll + mod1) % mod1;
    M.se = (M.se - 1ll + mod2) % mod2;
    // cout<<M.fi<<' '<<M.se<<endl;
    M2 = mp((M.fi + M.fi) % mod1, (M.se + M.se) % mod2);
    // cout<<M2.fi<<' '<<M2.se<<endl;
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        vis[key((- h[i].fi + mod1) % mod1, (- h[i].se + mod2) % mod2)] ++;
        vis[key((M2.fi - h[i].fi + mod1) % mod1, (M2.se - h[i].se + mod2) % mod2)] ++;
        vis[key((M.fi - h[i].fi + mod1) % mod1, (M.se - h[i].se + mod2) % mod2)] ++;
        for(int j = i; j <= n; j++) {
            pii cur = mp((h[i].fi + h[j].fi) % mod1, (h[i].se + h[j].se) % mod2);
            ans += vis[key(cur.fi,cur.se)];
        }
    }
    printf("%d", ans);
    return 0;
}

//things to remember
//1.long long
//2.array length
//3.freopen
//4 boarder case