#include "bits/stdc++.h"

#define range(a) begin(a), end(a)

using namespace std;
using i64 = long long;
constexpr int P = 1E9 + 7;

void norm(string &s) {
    while (s.size() > 1 && s.back() == '0') {
        s.pop_back();
    }
}

string add(const string &a, const string &b) {
    string res(max(a.size(), b.size()), '0');
    int i, j, t = 0;
    for (i = 0; i < min(a.size(), b.size()); i++) {
        int x = a[i] - '0' + b[i] - '0' + t;
        res[i] = x % 10 + '0';
        t = x / 10;
    }
    for(; i < a.size(); i++) {
        int x = a[i] - '0' + t;
        res[i] = x % 10 + '0';
        t = x / 10;
    }
    for (; i < b.size(); i++) {
        int x = b[i] - '0' + t;
        res[i] = x % 10 + '0';
        t = x / 10;
    }
    if (t) {
        res.push_back('0' + t);
    }
    norm(res);
    return res;
}

string sub(const string &a, const string &b) {
    string res(max(a.size(), b.size()), '0');
    int t = 0, i;
    for (i = 0; i < min(a.size(), b.size()); i++) {
        int x = a[i] - b[i] - t;
        if (x < 0) {
            t = 1, x += 10;
        } else {
            t = 0;
        }
        res[i] = x + '0';
    }
    for (; i < a.size(); i++) {
        int x = a[i] - '0' - t;
        if (x < 0) {
            t = 1, x += 10;
        } else {
            t = 0;
        }
        res[i] = x + '0';
    }
    norm(res);
    return res;
}

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

    int n, k;
    cin >> n >> k;
    vector<string> a(n);
    string M(k, '9');
    vector<int> c(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i]; 
        reverse(range(a[i]));  
        string h, res = "0";
        for (int j = 0; j < a[i].size(); j++) {
            h += a[i][j];
            if (h.size() == k) {
                res = add(res, h);
                if (res.size() > k) {
                    res = sub(res, M);
                } else if (res.size() == k && res == M) {
                    res = "0";
                }
                h = "";
            }
        }
        if (h.size()) {
            res = add(res, h);
            if (res.size() > k) {
                res = sub(res, M);
            } else if (res.size() == k && res == M) {
                res = "0";
            }
        }
        reverse(range(res));
        for (auto &ai : res) {
            c[i] = (c[i] * 10LL + ai - '0') % P;
        }
    }

    int M1 = 0;
    for (int i = 0; i < k; i++) {
        M1 = (M1 * 10LL + 9) % P;
    }
    int M2 = 2LL * M1 % P;

    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            for (int k = j; k < n; k++) {
                int x = (1LL * c[i] + c[j] + c[k]) % P;
                if (x == 0 || x == M1 || x == M2) {
                    ans++;
                }
            }
        }
    }
    cout << ans << '\n';

    return 0;
}