#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = (1ll << 61) - 1;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> val(n);
    for (int vi = 0; vi < n; ++vi) {
        static string s;
        static vector<int> a(k);
        cin >> s;
        fill(a.begin(), a.end(), 0);
        for (int i = s.size() - 1, j = 0; ~i; --i, j = (j + 1 == k ? 0 : j + 1)) {
            a[j] += s[i] - '0';
        }
        for (int i = 0; i + 1 < k; ++i) {
            int t = a[i] / 10;
            a[i + 1] += t;
            a[i] -= t * 10;
        } 
        while (a.back() >= 10) {
            int t = a.back() / 10;
            a[0] += t;
            a.back() -= t * 10;
            for (int i = 0; i + 1 < k; ++i) {
                int t = a[i] / 10;
                a[i + 1] += t;
                a[i] -= t * 10;
            } 
        }
        int sm = 0;
        for (int i = 0; i < k; ++i) {
            sm = ((__int128)sm * 10 + a[i]) % mod;
        }
        val[vi] = sm;
    }
    int cnt0 = count(val.begin(), val.end(), 0);
    int ans = cnt0 * (cnt0 + 1) * (cnt0 + 2) / 6;
    unordered_map<int, int> mp;
    int S = 1;
    for (int i = 0; i < k; ++i) S = (__int128)S * 10 % mod;
    S = (S + mod - 1) % mod;
    for (int i = 0; i < n; ++i) {
        ++mp[val[i]];
        for (int j = i; j < n; ++j) {
            int tar1 = (S - val[i] - val[j] + 2 * mod) % mod;
            int tar2 = (S + tar1) % mod;
            ans += mp[tar1] + mp[tar2];
        }
    }
    cout << ans << endl;
    return 0;
}