//
// Created by codicon on 3/9/2024 at 10:05 PM.
//

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 500, MAXK = 2e4;
const int MODS[2] = {(int)1e9+7, (int)1e9 + 9};

int a[MAXN][MAXK];  // After taking mod M
long long mod_of_a[MAXN][2], mod_of_m[2];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, k; cin >> n >> k;

    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        reverse(s.begin(), s.end());

        for (int j = 0; j < size(s); j++) {
            a[i][j%k] += s[j] - '0';
        }

        for (int j = 0; j < k or a[i][j%k] > 9; j++) {
            // Be careful when k = 1
            int carry = a[i][j%k] / 10;
            a[i][j%k] %= 10;
            a[i][(j+1) % k] += carry;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int m = 0; m < 2; m++) {
            for (int j = k-1; j >= 0; j--) {
                mod_of_a[i][m] = (10 * mod_of_a[i][m] + a[i][j]) % MODS[m];
            }
        }
    }
    for (int m = 0; m < 2; m++) {
        for (int j = k-1; j >= 0; j--) {
            mod_of_m[m] = (10 * mod_of_m[m] + 9) % MODS[m];
        }
    }

    int ans = 0;

    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            for (int k = j; k < n; k++) {
                bool work = true;

                for (int m = 0; m < 2; m++) {
                    long long tot = (mod_of_a[i][m] + mod_of_a[j][m] + mod_of_a[k][m]) % MODS[m];

                    if (not (tot == 0 or tot == mod_of_m[m]
                             or tot == 2*mod_of_m[m] % MODS[m]
                             or tot == 3*mod_of_m[m] % MODS[m])) {
                        work = false;
                    }
                }

                ans += work;
            }
        }
    }

    cout << ans;
}