#include "bits/stdc++.h"

using namespace std;

const int N = (int) 1e5;
int md[3] = {(int) 1e9 + 9, (int) 1e9 + 7, (int) 998244353};
int p[3] = {(int) 1243151, (int) 1343251, (int) 342351};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(n, vector<int> (3));
    vector<int> good(n);
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j + k < (int) s.size(); j++) {
            while (s[j] > '0') {
                s[j]--;
                int uk = (int) s.size() - 1;
                while (1) {
                    if (s[uk] == '9') {
                        s[uk] = '0';
                        uk++;
                    } else {
                        s[uk]++;
                        break;
                    }
                }
            }
        }
        if ((int) s.size() > k) {
            s = s.substr((int) s.size() - k, k);
        }
        if (std::count(s.begin(), s.end(), '9') == k || std::count(s.begin(), s.end(), '0') == (int) s.size()) {
            s = "0";
            good[i] = 1;
        }
        for (int j = 0; j < 3; j++) {
            for (auto c : s) {
                a[i][j] = (a[i][j] * 10 + c - '0') % md[j];
            }
        }
    }
    vector<vector<int>> res(2, vector<int> (3));
    for (int j = 0; j < 3; j++) {
        string s(k, '9');
        for (auto c : s) {
            res[0][j] = (res[0][j] * 10 + c - '0') % md[j];
        }
        res[1][j] = (res[0][j] + res[0][j]) % md[j];
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            for (int k = j; k < n; k++) {
                if (good[i] && good[j] && good[k]) {
                    ans++;
                    continue;
                }
                for (int t = 0; t < 2; t++) {
                    if (((a[i][0] + a[j][0]) % md[0] + a[k][0]) % md[0] != res[t][0]) {
                        continue;
                    }
                    if (((a[i][1] + a[j][1]) % md[1] + a[k][1]) % md[1] != res[t][1]) {
                        continue;
                    }
                    if (((a[i][2] + a[j][2]) % md[2] + a[k][2]) % md[2] != res[t][2]) {
                        continue;
                    }
                    ans++;
                    break;
                }
            }
        }
    }
    cout << ans;
}