#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
ll sz(auto& a) { return size(a); }
template<class T> bool chmin(T& a, T b) { if(a <= b) return 0; a = b; return 1; }
template<class T> bool chmax(T& a, T b) { if(a >= b) return 0; a = b; return 1; }

using u128 = __uint128_t;
random_device rnd;
const u128 m = (u128)INF << 64 | (u128)rnd() << 32 | rnd();
struct mm {
    u128 x;
    mm(u128 x = 0): x(x) {}
    mm &operator+=(mm b){if((x+=b.x) >= m) x-=m; return *this;}
    friend mm operator+(mm a, mm b){ return a+=b;}
    mm d() const { return *this + *this; }
    friend bool operator==(mm a, mm b) { return a.x == b.x; }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll N, K;
    cin >> N >> K;
    mm M = 0;
    rep(_, 0, K) {
        M += M;
        M += M.d().d();
        M += 9;
    }

    auto get = [&] {
        string S;
        cin >> S;
        ranges::reverse(S);
        vector<ll> A(K);
        rep(i, 0, sz(S)) {
            ll j = i % K;
            A[j] += S[i] - '0';
            while(A[j] >= 10) {
                A[j] -= 10;
                j++;
                if(j == K) j = 0;
                A[j]++;
            }
        }
        mm x = 0;
        for(ll d : A | views::reverse) {
            x += x;
            x += x.d().d();
            x += d;
        }
        return x;
    };
    vector<mm> A(N);
    for(mm& a : A) a = get();

    ll ans = 0;
    rep(i, 0, N) rep(j, i, N) rep(k, j, N) {
        const mm s = A[i] + A[j] + A[k];
        ans += s == 0 || s == M || s == M + M || s == M + M + M;
    }

    cout << ans << endl;
}