#include <bits/stdc++.h>
using namespace std;

#define ll long long
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

bool isprime(int n) {
	if (n <= 1) return false;
	for (int i = 2; i*i <= n; i++) {
		if (n%i == 0) return false;
	}
	return true;
}
int findPrime(int n) {
	while (!isprime(n)) {
		n++;
	}
	return n;
}
const ll M = 9e8, M1 = 1e8;
const ll mod = rng()+1;
const int N = 200000+2;

void solve() {
    int n, k;
    cin>>n>>k;
    vector<ll> arr(n+1);
    ll M0 = 0;
    for (int i = 1; i <= k; i++) {
        M0 = M0 * 10 % mod + 9; 
        M0 %= mod;
    }
    for (int i = 1; i <= n; i++) {
        string s;
        cin>>s;
        reverse(s.begin(), s.end());
        vector<ll> a(k+1);
        for (int j = 0; j < s.size(); j++) {
            a[j%k] += s[j]-'0';
        }
        while (a[0] > 9) {
            for (int j = 0; j < k; j++) {
                a[j+1] += a[j]/10;
                a[j] %= 10;
            }
            a[0] += a[k];
            a[k] = 0;
        }
        ll val = 0;
        for (int j = k-1; j >= 0; j--) {
            val = val * 10 % mod + a[j];
            val %= mod;
        }
        if (val == M0) val = 0;
        arr[i] = val;
    }
    vector<ll> v;
    set<ll> st;
    for (int t = 0; t < 3; t++) {
        st.insert(mod*t);
        v.push_back(M0*t%mod);
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            for (int l = j; l <= n; l++) {
                for (int o = 0; o < 3; o++) {
                    if (st.count(arr[i]+arr[j]+arr[l]-v[o])) {
                        ans++;
                        break;
                    }
                }
            }
        }
    }
    cout<<ans<<'\n';
}

int main()
{
    if (ifstream("test.in")) {
        freopen("test.in", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    // cin>>T;
    while (T--) {
        solve();
    }
    return 0;
}