#include<bits/stdc++.h>

using namespace std;

using ll = long long;

vector<int> operator+(vector<int> a, vector<int> b) {
    int d = 0;
    int sz = max(a.size(), b.size());
    a.resize(sz, 0);
    b.resize(sz, 0);
    for (int i = 0; i < sz; ++i) {
        a[i] += b[i] + d;
        d = a[i] / 10;
        a[i] %= 10;
    }
    if (d) a.push_back(d);
    while (a.size() && a.back() == 0) a.pop_back();
    return a;
}
uint64_t mod = (1ll << 61) - 1;
uint64_t base = 37;

uint64_t add(uint64_t a, uint64_t b) {
    return a + b >= mod ? a + b - mod : a + b;
}

uint64_t sub(uint64_t a, uint64_t b) {
    return a >= b ? a - b : a + mod - b;
}

uint64_t mul(uint64_t a, uint64_t b) {
    return (__int128)a * b % mod;
}

bool lss(vector<int> a, vector<int> b) {
    if (a.size() != b.size()) return a.size() < b.size();
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        if (a[i] != b[i]) return a[i] < b[i];
    }
    return false;
}

uint64_t nhash(vector<int> a) {
    uint64_t pw = 1;
    uint64_t hsh = 0;
    for (auto i : a) {
        hsh = add(hsh, mul(i, pw));
        pw = mul(pw, base);
    }
    return hsh;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, K;
    cin >> n >> K;
    vector<vector<int>> num(n);
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        reverse(s.begin(), s.end());
        vector<int> a(s.size());
        for (int j = 0; j < s.size(); ++j) a[j] = s[j] - '0';
        while (a.size() > K) {
            vector<int> b;
            for (int j = 0; j < a.size(); j += K) {
                b = b + vector(a.begin() + j, a.begin() + min((int)a.size(), j + K));
            }
            a = b;
        }
        if (*min_element(a.begin(), a.end()) == 9) a = {};
        while (a.size() && a.back() == 0) a.pop_back();
        num[i] = a;
    }
    vector<int> MOD(K, 9);
    auto hmod = nhash(MOD);
    sort(num.begin(), num.end(), lss);
    vector<int> ha(n);
    for (int i = 0; i < n; ++i) ha[i] = nhash(num[i]);
    map<uint64_t, int> cnt;
    int ret = 0;
    for (int i = 0; i < n; ++i) {
        auto hha = ha[i];
        if (num[i].size()) hha = sub(hmod, hha);
        cnt[hha]++;
        int l = i - 1, r = n;
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (lss(num[i] + num[m], MOD)) l = m;
            else r = m;
        }
        for (int j = i; j < n; ++j) {
            uint64_t hh = add(ha[i], ha[j]);
            if (j > l) hh = sub(hh, hmod);
            ret += cnt[hh];
        }
    }
    cout << ret;
}