#include <bits/stdc++.h>

using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using f64 = long double;

template<typename T, typename U>
void chkmax(T &a, U b) { if(a < b) a = b; }
template<typename T, typename U>
void chkmin(T &a, U b) { if(a > b) a = b; }

// constexpr int P = 998244353;
constexpr u64 P = 100055128505716009ll;

void init() { }

void solve()
{
    int n, k;
    std::cin >> n >> k;
    u64 hk = 9;
    std::vector<u64> hsh(n + 1), hp(k, 1);
    for(int i = 1; i < k; ++i) {
        hp[i] = hp[i - 1] * 10 % P;
        hk = (hk + 9 * hp[i]) % P;
    }
    for(int i = 1; i <= n; ++i) {
        std::string s;
        std::cin >> s;
        int m = s.length();
        std::vector<int> c(k);
        for(int j = 0; j < m; ++j) {
            c[j % k] += s[m - j - 1] - '0';
        }
        if(k == 1) {
            c[0] %= 9;
        } else {
            while(1) {
                for(int j = 0; j < k - 1; ++j) {
                    c[j + 1] += c[j] / 10;
                    c[j] %= 10;
                }
                if(c[k - 1] < 10) {
                    break;
                }
                c[0] += c[k - 1] / 10;
                c[k - 1] %= 10;
            }
        }
        for(int j = 0; j < k; ++j) {
            hsh[i] = (hsh[i] + hp[j] * c[j] % P) % P;
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = i; j <= n; ++j) {
            for(int k = j; k <= n; ++k) {
                if((hsh[i] + hsh[j] + hsh[k]) % P == 0 || (hsh[i] + hsh[j] + hsh[k]) % P == hk || (hsh[i] + hsh[j] + hsh[k]) % P == (hk * 2) % P) {
                    ++ans;
                }
            }
        }
    }
    std::cout << ans << '\n';
}

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    init();
    int T = 1;
    // std::cin >> T;
    while(T --) solve();
    return 0;
}