#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

typedef long long LL;
int N, K;

vector<int> add(const vector<int>& a, const vector<int>& b) {
    vector<int> res(a.begin(), a.end());
    bool carry = 0;
    for (int w = K-1; w >= 0; w--) {
        res[w] += b[w] + carry;
        carry = res[w] > 9;
        res[w] %= 10;
    }
    if (!carry) return res;
    vector<int> one(K, 0);
    one[K-1] = 1;
    return add(res, one);
}


vector<int> simplify(const vector<int>& a) {
    bool all_9 = true;
    for (int i = 0; i < K; i++) {
        if (a[i] != 9) {
            all_9 = false;
            break;
        }
    }
    if (!all_9) return a;
    return vector(K,0);
}
vector<int> inverse(const vector<int>& a) {
    vector<int> res(K, 0);
    for (int i = 0; i < K; i++) res[i] = 9 - a[i];
    return simplify(res);
}

vector<int> parse(string s) {
    vector<int> res(K, 0);
    for (int i = 0; i< min(int(s.size()),K); i++) {
        res[K-i-1] = s[s.size()-i-1] - '0';
    }
    if (s.size() <= K) return simplify(res);
    auto rest = parse(s.substr(0, s.size()-K));
    return simplify(add(rest, res));
}

int main() {
    cin >> N >> K;
    map<vector<int>, int> nums;
    for (int i = 1; i <= N; i++) {
        string s;
        cin >> s;
        auto num = parse(s);
        // cout << s << endl;
        // cout << num[0] << endl;
        nums[num] += 1;
    }
    int cnt = 0;
    for (auto it1 = nums.begin(); it1 != nums.end(); it1++) {
        int num1 = it1-> second;
        for (auto it2 = nums.begin(); it2 != nums.end(); it2++) {
            int num2 = it2-> second;
            auto target = inverse(add(it1->first, it2->first));
            auto it3 = nums.find(target);
            if (it3 == nums.end()) continue;
            
            // cout << it1->first[0] << ' ' << it2->first[0] << ' ' << target[0] << endl;



            int num3 = it3->second;
            int nn = num1*num2*num3;
            if (it1 == it2 && it2 == it3) {
                cnt += nn * 6;
                continue;
            }
            if (it1 == it2 || it1 == it3 || it2 == it3) {
                cnt += nn * 3;
                continue;
            }
            cnt += num1*num2*num3;
        }
    }
    cout << cnt/6<< endl;
}