#include<iostream>
#include<unordered_map>
#define int long long
using namespace std;
const int maxn = 505;
const int maxd = 20005;
const int modv = (int) 1e9+7;
int n,k,cnum[maxd],arr[maxn];
unordered_map<int,int> amn;
signed main () {
    scanf("%lld%lld",&n,&k);
    int mmod = 0;
    for(int i = k-1; i >= 0; i--) {
        mmod = (mmod*((int) 10)+((int)9))%modv;
    }
    for(int i = 0; i < n; i++) {
        string a;
        cin >> a;
        for(int j = 0; j < a.size(); j++) {
            cnum[a.size()-1-j] = a[j]-'0';
        }
        int csz = a.size()-1;
        while(csz >= k) {
            for(int j = csz; j >= k; j--) {
                cnum[j-k] += cnum[j];
                cnum[j] = 0;
            }
            int pcsz = csz;
            int ncsz = 0;
            for(int j = 0; j < pcsz; j++) {
                cnum[j+1] += cnum[j]/10;
                cnum[j] = cnum[j]%10;
            }
            for(int j = 0; j <= pcsz; j++) {
                if(cnum[j] > 0) ncsz = j;
            }
            csz = ncsz;
        }
        for(int j = csz; j >= 0; j--) {
            arr[i] = (arr[i]*((int) 10)+cnum[j])%modv;
        }
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j <= i; j++) {
            int v1 = (((-(arr[j]+arr[i])%modv)%modv)+modv)%modv;
            int v2 = (((mmod-(arr[j]+arr[i])%modv)%modv)+modv)%modv;
            int v3 = (((mmod*2-(arr[j]+arr[i])%modv)%modv)+modv)%modv;
            amn[v1]++;
            amn[v2]++;
            amn[v3]++;
        }
        ans += amn[arr[i]];
    }
    printf("%lld\n",ans);
    return 0;
}