#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll mod = 6170354867284747;
const ll mod2 = 9744671674686547;
// #include <brawlstars>
// FOR PAIN OR FOR GLORYYY ELLL PRIMOOOOOO

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
	ll n, k;
	cin >> n >> k;
	string s;
	ll a[n], a2[n], tmp[20001], cur;
	for(ll i = 0; i < n; i++) {
		cin >> s;
		reverse(s.begin(), s.end());
		for(ll j = 0; j < k; j++) tmp[j] = 0;
		for(ll j = 0; j < s.size(); j++) tmp[j % k] += s[j] - '0';
		cur = 0;
		while(1) {
			for(ll j = 0; j < k; j++) tmp[j] += cur, cur = tmp[j] / 10, tmp[j] %= 10;
			if(!cur) break;
		}
		a[i] = 0, a2[i] = 0;
		for(ll j = k - 1; j >= 0; j--) a[i] = (a[i] * 10 + tmp[j]) % mod, a2[i] = (a2[i] * 10 + tmp[j]) % mod2;
	}
	ll kk = 0, kk2 = 0, ans = 0, cur2;
	for(ll i = 0; i < k; i++) kk = (kk * 10 + 9) % mod, kk2 = (kk2 * 10 + 9) % mod2;
	for(ll i = 0; i < n; i++) {
		for(ll j = i; j < n; j++) {
			for(ll k = j; k < n; k++) {
				cur = (a[i] + a[j] + a[k]) % mod, cur2 = (a2[i] + a2[j] + a2[k]) % mod2;
				for(int l = 0; l < 4; l++) {
					if(cur == l * kk % mod || cur2 == l * kk % mod) {
						ans++;
						break;
					}
				}
			}
		}
	}
	cout << ans << "\n";
}