#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;

//const int MN = 2e5 + 20;
const int INF = 2e9 + 1000;
const LL INFLL = 8e18 + 1000;
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~
const LL mod = 444445555566666677;

LL MOD(LL x) {
    if(x < 0) x += mod;
    if(x >= mod) x -= mod;
    return x;
}
LL veryMOD(LL x) {
    while(x < 0) x += mod;
    while(x >= mod) x -= mod;
    return x;
}
LL mul(LL x, LL y) {
    return (__int128_t)x * y % mod;
}

void solve() {
    int n, k; cin >> n >> k;
    LL M = 0;
    for(int i = 1; i <= k; i++) {
        M = MOD(mul(M, 10) + 9);
    }
    V<LL> a(n + 1);
    for(int i = 1; i <= n; i++) {
        string s; cin >> s;
        V<int> v(k);
        reverse(all0(s));
        for(int i = 0; i < s.size(); i++) {
            v[i % k] += s[i] - '0';
        }
        while(1) {
            bool ok = 0;
            for(int j = 0; j < k; j++) {
                if(v[j] >= 10) {
                    ok = 1;
                    assert(i < 4);
                    int tmp = v[j] / 10;
                    v[j] %= 10;
                    v[(j + 1) % k] += tmp;
                }
            }
            if(!ok) break;
        }
        LL now = 0;
        LL cur = 1;
        for(int i = 0; i < k; i++) {
            now = MOD(now + mul(cur, v[i]));
            cur = mul(cur, 10);
        }
        a[i] = now;
    }
    // cout << M << endl;
    LL ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= n; j++) {
            for(int k = j; k <= n; k++) {
                LL tmp = veryMOD(a[i] + a[j] + a[k]);
                if(tmp == 0 || tmp == M || tmp == MOD(M + M) || tmp == veryMOD(M * 3)) {
                    ans++;
                }
            }
        }
    }
    cout << ans << endl;

}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) 
    solve();
}