#include <bits/stdc++.h>
typedef unsigned long long ULL;
#define TIME std::chrono::system_clock::now().time_since_epoch().count()
template<typename Tp> Tp Rand(const Tp l, const Tp r) {
	static std::mt19937_64 rng(TIME);
	return Tp(double(rng()) / ULLONG_MAX * (r - l + 1)) + l;
}
const int M = 507, N = 2e4 + 7;
int n, K, cnt0 = 0, ans = 0; char a[M][N]; ULL P[2], s[M][2];
std::map<std::pair<ULL, ULL>, int> mp;
void solve(ULL m0, ULL m1) {
    auto count = [&](int i, int j) {
        ULL h0 = (m0 - s[i][0] - s[j][0] + P[0] * 2) % P[0];
        ULL h1 = (m1 - s[i][1] - s[j][1] + P[1] * 2) % P[1];
        return mp.count(std::make_pair(h0, h1)) ? mp[std::make_pair(h0, h1)] : 0;
    };
    int sum = 0;
    for(int i = 1; i <= n; i++) {
        mp[std::make_pair(s[i][0], s[i][1])]--;
        for(int j = i + 1; j <= n; j++) {
            mp[std::make_pair(s[j][0], s[j][1])]--;
            sum += count(i, j);
            mp[std::make_pair(s[j][0], s[j][1])]++;
        }
        mp[std::make_pair(s[i][0], s[i][1])]++;
        ans += count(i, i);
    }
    ans += sum / 3;
}
int main() {
    for(int i = 0; i < 2; i++) P[i] = Rand((ULL)5e18, (ULL)6e18);
    scanf("%d%d", &n, &K);
    for(int i = 1; i <= n; i++) {
        scanf("%s", a[i]); int len = strlen(a[i]);
        std::reverse(a[i], a[i] + len);
        for(int j = 0; j < len; j++) a[i][j] -= '0';
        for(int j = len / K * K; j; j -= K) do {
            for(int k = j; k < j + K; k++) {
                if(k < len) a[i][k - j] += a[i][k], a[i][k] = 0;
                if(a[i][k - j] >= 10) a[i][k - j] -= 10, a[i][k - j + 1]++;
            }
            int k = K;
            while(a[i][k] >= 10) a[i][k] -= 10, a[i][++k]++;
        } while(a[i][j]);
        bool all9 = 1;
        for(int j = 0; j < K; j++) if(a[i][j] != 9) all9 = 0;
        if(all9) for(int j = 0; j < K; j++) a[i][j] = 0;
        for(int j = K; j; j--) s[i][0] = (s[i][0] * 10 + a[i][j - 1]) % P[0];
        for(int j = K; j; j--) s[i][1] = (s[i][1] * 10 + a[i][j - 1]) % P[1];
        mp[std::make_pair(s[i][0], s[i][1])]++;
    }
    ULL m0 = 0, m1 = 0;
    for(int i = 0; i < K; i++) m0 = (m0 * 10 + 9) % P[0], m1 = (m1 * 10 + 9) % P[1];
    solve(0, 0), solve(m0, m1), solve(m0 * 2 % P[0], m1 * 2 % P[1]);
    return printf("%d\n", ans), 0;
}