#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, K, ans = 0; cin >> n >> K;
    vector<string> s(n + 1); s[0].assign(K, 9);
    for(int i = 1; i <= n; ++i) {
        cin >> s[i], reverse(s[i].begin(), s[i].end());
        for(char &ch : s[i]) ch -= 48;
        const int l = (int)s[i].size() - K;
        for(int w = l - 1; w >= 0; ) {
            s[i][w] += s[i][w + K], s[i][w + K] = 0;
            if(s[i][w] >= 10) s[i][w] -= 10, ++s[i][w + 1];
            while(w >= 0 && !s[i][w + K]) --w;
        }
        s[i].resize(K); if(s[i] == s[0]) s[i].assign(K, 0);
    }
    vector<vector<bitset<501>>> r(n + 1);
    for(auto &it : r) it.resize(n + 1);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) r[i][j].set();
    const auto &check = [&](const int64 mod) {
        unordered_map<int64, bitset<501>> M;
        vector<int64> t(n + 1);
        for(int i = 0, j; i <= n; t[i++] %= mod) {
            for(j = K - 1; j >= 3; j -= 4)
                t[i] = (t[i] * 10000 + s[i][j] * 1000 \
                    + s[i][j - 1] * 100 + s[i][j - 2] * 10 + s[i][j - 3]) % mod;
            while(j >= 0) t[i] = t[i] * 10 + s[i][j--];
        }
        const auto &add = [&](int64 x, int64 y)
            { return x + y >= mod ? x + y - mod : x + y; };
        const auto &sub = [&](int64 x, int64 y)
            { return x - y < 0 ? x - y + mod : x - y; };
        for(int i = 1; i <= n; ++i) {
            M[t[i]].set(i);
            for(int j = i; j <= n; ++j) {
                const int64 k = add(t[i], t[j]);
                const int64 v0 = k ? sub(t[0], k) : 0;
                const int64 v1 = add(t[0], v0);
                if(M.count(v0) && M.count(v1))
                    r[i][j] &= M[v0] | M[v1];
                else if(M.count(v0)) r[i][j] &= M[v0];
                else if(M.count(v1)) r[i][j] &= M[v1];
                else r[i][j].reset();
            }
        }
    };
    check(0x66ccff'ff0000 + 43);
    check(0x66ccff'ff0000 + 61);
    check(0x66ccff'ff0000 + 157);
    check(0x66ccff'ff0000 + 215);
    check(0x66ccff'ff0000 + 263);
    for(int i = 1; i <= n; ++i)
        for(int j = i; j <= n; ++j)
            ans += r[i][j].count(); printf("%d\n", ans);
}