#include <bits/stdc++.h>
using namespace std;
constexpr int N = 20005, M = 505;
using ll = long long;
constexpr ll mod = 1e17 + 9;
int n, k;
ll a[M];
ll tmp[N];
int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j <= k; j++)
            tmp[j] = 0;
        for (int j = 0; j < (int)(s.size()); j++) {
            tmp[j % k] += s[j] - '0';
        }
        do {
            for (int j = 0; j < k; j++) {
                tmp[j + 1] += tmp[j] / 10;
                tmp[j] %= 10;
            }
            tmp[0] += tmp[k];
        } while (tmp[0] >= 10);
        for (int j = 0; j < k; j++)
            a[i] = (a[i] * 10 + tmp[j]) % mod;
    }
    ll w1 = 0;
    for (int i = 0; i < k; i++)
        w1 = (w1 * 10 + 9) % mod;
    ll w2 = 2 * w1 % mod, w3 = 3 * w1 % mod;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            for (int k = j; k <= n; k++) {
                ll t = (a[i] + a[j] + a[k] % mod);
                if (t == 0 || t == w1 || t == w2 || t == w3) {
                    ans++;
                }
            }
        }
    }
    cout << ans << "\n";
}