#include <bits/stdc++.h>

using namespace std;

#define int long long

constexpr int mod1 = 4179340454199820289;
constexpr int mod2 = 998244353;
constexpr int mod3 = 180143985094819841;
constexpr int base = 10;

using i128 = __int128_t;

struct HH {
    int a = 0;
    int b = 0;
    int c = 0;
};

void inc(HH &x, HH y) {
    x.a += y.a;
    x.b += y.b;
    x.c += y.c;
    if (x.a >= mod1) x.a -= mod1;
    if (x.b >= mod2) x.b -= mod2;
    if (x.c >= mod3) x.c -= mod3;
    
}
HH add(HH x, HH y) {
    inc(x, y);
    return x;
}
HH mul(HH x, HH y) {
    int p = i128(x.a) * y.a % mod1;
    int q = i128(x.b) * y.b % mod2;
    int r = i128(x.c) * y.c % mod3;

    return HH{p, q, r};
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, K;
    cin >> n >> K;

    auto Mod = [&](string s) {
        reverse(s.begin(), s.end());
        int m = s.size();
        vector<int> b(K);
        for (int j = 0; j < s.size(); j++) {
            b[j % K] += s[j] - '0';
        }
        while (true) {
            bool ok = 1;
            for (int j = 0; j < K; j++) {
                if (b[j] >= 10) ok = 0;
            }
            if (ok) break;

            vector<int> c(K);
            for (int j = 0; j < K; j++) {
                c[j] += b[j] % 10;
                c[(j + 1) % K] += b[j] / 10;
            }
            b = move(c);
        }
        if (b == vector<int>(K, 9)) b = vector<int>(K, 0);
        return b;
    };
    auto Hash = [&](vector<int>b) {
        reverse(b.begin(), b.end());
        HH hash;
        for (int j = 0; j < K; j++) {
            hash = add(mul(hash, HH{10, 10, 10}), HH{b[j], b[j], b[j]});
        }
        return hash;
    };


    vector<HH> a(n);
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        
        a[i] = Hash(Mod(s));
    }
    auto equal = [&](HH x, HH y) {
        return x.a == y.a && x.b == y.b && x.c == y.c;
    };

    int ans = 0;
    auto solve = [&](HH val) {
        for (int i = 0; i < n; i++) {
            for (int j = i; j < n; j++) {
                for (int k = j; k < n; k++) {
                    if (equal(add(add(a[i], a[j]), a[k]), val)) {
                        ans++;
                    }
                }
            }
        }
    };
    solve(HH{0, 0, 0});

    HH h1;
    for (int i = 0; i < K; i++) {
        h1 = add(mul(h1, {base, base, base}), {9, 9, 9});
    }
    solve(h1);


    HH h2 = {1, 1, 1};
    for (int i = 0; i < K - 1; i++) {
        h2 = add(mul(h2, {base, base, base}), {9, 9, 9});
    }
    h2 = add(mul(h2, {base, base, base}), {8, 8, 8});
    solve(h2);

    cout << ans;

    return 0;
}