#include<bits/stdc++.h>

using namespace std;
const int MOD = 1e9 + 7;


int sum(int a, int b) { return (0ll + a + b + MOD) % MOD; }
int mul(int a, int b) { return (1ll * a * b) % MOD; }
int Pow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = mul(res, a);
        a = mul(a, a);
        b >>= 1;
    }
    return res;
}

vector<int> get_digits(string s) {
    vector<int> digits;
    for (char c : s) digits.push_back(c - '0');
    reverse(digits.begin(), digits.end());
    return digits;
}

int Hash(vector<int> &digits) {
    int res = 0;
    for (int i = digits.size() - 1; i >= 0; i--) {
        res = sum(mul(res, 10), digits[i]);
    }
    return res;
}
void add(vector<int> &a, vector<int> &digits, int k) {
    int n = digits.size();
    vector<int> num(k);
    for (int i = 0; i < n; i++) {
        num[i%k] += digits[i];
    }
    for (int i = 0; i < num.size(); i++) {
        if (num[i] < 10) continue;
        if (i + 1 == num.size()) num.push_back(0);
        num[i + 1] += num[i] / 10;
        num[i] %= 10;
    }
    if (num.size() == k) {
        bool flag = 1;
        for (int i = 0; i < k; i++) if (num[i] != 9) flag = 0;
        if (flag) 
            for (int i = 0; i < k; i++) num[i] = 0;
        a.push_back(Hash(num));
    } else {
        add(a, num, k);
    }
}
map<int, int> cnt;

int threesum(vector<int> &a, int s) {
    int n = a.size();
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int rem = sum(s, -sum(a[i], a[j]));
            if (rem == a[i]) ans--;
            if (rem == a[j]) ans--;
            ans += cnt[rem];
        }
    }
    ans /= 6;
    for (int i = 0; i < n; i++) {
        int rem = sum(s, -sum(a[i], a[i]));
        ans += cnt[rem];
    }
    return ans;
}
void Solve() {
    int n, k; cin >> n >> k;
    vector<int> a;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        vector<int> digits = get_digits(s);
        add(a, digits, k);
    }
    for (int i = 0; i < n; i++) cnt[a[i]]++;
    int ans = 0;
    ans += threesum(a, 0);
    vector<int> d;
    for (int i = 0; i < k; i++) d.push_back(9);
    int h = Hash(d);
    ans += threesum(a, h);
    d.clear();
    d.push_back(8);
    for (int i = 0; i < k - 1; i++) d.push_back(9);
    d.push_back(1);
    h = Hash(d);
    ans += threesum(a, h);
    cout << ans << '\n';
}
int main () {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1; //cin >> t;
    while (t--) Solve();
}