#include<bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC target("avx2")

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;
        if (a[i] < 10)d = 0;
        else d = 1, a[i] -= 10;
    }
    if (d) a.push_back(d);
    while (a.size() && a.back() == 0) a.pop_back();
    return a;
}
int mod = 1e9+ 321;
int base = 11;

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

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

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

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

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

int nxt() {
    int x = 0;
    while (true) {
        auto c = getchar();
        if ('0' <= c && c <= '9') {
            x *= 10;
            x += c - '0';
        } else {
            break;
        }
    }
    return x;
}

int main() {

    int n = nxt(), K = nxt();
    vector<vector<int>> num(n);
    for (int i = 0; i < n; ++i) {
        string s;
        while (true) {
            auto c = getchar();
            if ('0' <= c && c <= '9') s += c;
            else break;
        }
        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(K, 0);
            for (int j = 0; j < K; ++j) {
                for (int c = j; c < a.size(); c += K) {
                    b[j] += a[c];
                }
            }
            int d = 0;
            for (int j = 0; j < K; ++j) {
                b[j] += d;
                d = b[j] / 10;
                b[j] %= 10;
            }
            if (d) b.push_back(d);
            a = b;
        }
        if (*min_element(a.begin(), a.end()) == 9) fill(a.begin(), a.end(), 0);
        a.resize(K, 0);
        num[i] = a;
    }
    vector<int> MOD(K, 9);
    auto hmod = nhash(MOD);
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    for (int i = 0; i < K; ++i) {
        vector<int> cnt(10);
        for (auto j : p) {
            cnt[num[j][i]]++;
        }
        for (int j = 1; j < 10; ++j) cnt[j] += cnt[j - 1];
        vector<int> q(n);
        reverse(p.begin(), p.end());
        for (auto j : p) {
            q[--cnt[num[j][i]]] = j;
        }
        p = q;
    }
    vector<int> ha(n);
    for (int i = 0; i < n; ++i) ha[i] = nhash(num[p[i]]);
    map<int, int> cnt;
    int ret = 0;
    for (int i = 0, k = n - 1; i < n; ++i) {
        auto hha = ha[i];
        if (*max_element(num[i].begin(), num[i].end()) != 0) hha = sub(hmod, hha);
        cnt[hha]++;
        while (k >= 0 && !lss(num[p[i]] + num[p[k]], MOD)) k--;
        for (int j = i; j < n; ++j) {
            int hh = add(ha[i], ha[j]);
            if (j > k) hh = sub(hh, hmod);
            ret += cnt[hh];
        }
    }
    cout << ret;
}