#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5;
const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;
int n, K;
struct bigint
{
    vector<int> num;
    void read()
    {
        string s;
        cin >> s;
        for (int i = 0; i < s.size(); i++)
            num.push_back(s[i] - '0');
        reverse(num.begin(), num.end());
    }
    pair<int, int> hs()
    {
        vector<int> tmp(K + 1, 0);
        for (int i = 0; i < num.size(); i += K)
        {
            int flag = 1, flag2 = 0;
            for (int j = i; j < i + K && j < num.size(); j++)
            {
                tmp[j - i] += num[i];
                if (tmp[j - i] >= 10)
                    tmp[j - i] -= 10, tmp[j - i + 1]++;
                if (tmp[j - i] != 9)
                    flag = 0;
                if (j == i + K - 1)
                    flag2 = 1;
            }
            if ((flag && flag2) || tmp[K] == 1)
            {
                for (int i = 0; i < K; i++)
                {
                    tmp[i] -= 9;
                    if (tmp[i] < 0)
                        tmp[i] += 10, tmp[i + 1]--;
                }
            }
        }
        reverse(tmp.begin(), tmp.end());
        int h1 = 0, h2 = 0;
        for (int i = 0; i < tmp.size(); i++)
        {
            h1 = (h1 * 1LL * 10 + tmp[i]) % mod1;
            h2 = (h2 * 1LL * 10 + tmp[i]) % mod2;
        }
        return {h1, h2};
    }
    pair<int, int> hs2()
    {
        int h1 = 0, h2 = 0;
        reverse(num.begin(), num.end());
        for (int i = 0; i < num.size(); i++)
        {
            h1 = (h1 * 1LL * 10 + num[i]) % mod1;
            h2 = (h2 * 1LL * 10 + num[i]) % mod2;
        }
        return {h1, h2};
    }
} a[N], m1, m2, m3;
pair<int, int> cur[N], h1, h2, h3;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> K;
    for (int i = 1; i <= n; i++)
        a[i].read(), cur[i] = a[i].hs();
    m1.num.push_back(0);
    for (int i = 0; i < K; i++)
        m2.num.push_back(9);
    m3.num.push_back(8);
    for (int i = 0; i < K - 1; i++)
        m3.num.push_back(9);
    m3.num.push_back(1);
    h1 = m1.hs2();
    h2 = m2.hs2();
    h3 = m3.hs2();
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = i; j <= n; j++)
            for (int k = j; k <= n; k++)
            {
                int t1 = (cur[i].first * 1LL + cur[j].first + cur[k].first) % mod1;
                int t2 = (cur[i].second * 1LL + cur[j].second + cur[k].second) % mod2;
                pair<int, int> now = {t1, t2};

                if (now == h1 || now == h2 || now == h3)
                {
                    ans++;
                }
            }
    cout << ans << '\n';
}