#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 = 1e9 + 7;
// #include <brawlstars>
// FOR PAIN OR FOR GLORYYY ELLL PRIMOOOOOO

typedef array<ll, 3> arr;
const arr mod = {1000000007, 1000000009, 1000000021};

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n, k;
	cin >> n >> k;
	string s;
	ll tmp[k], bk;
	arr a[n];
	map<int, int> mp[3];
	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 < (ll)s.size(); j++) tmp[j % k] += s[j] - '0';
		bk = 0;
		for(ll j = 0; j < k; j++) tmp[j] += bk, bk = tmp[j] / 10, tmp[j] %= 10;
		while(bk) {
			for(ll j = 0; j < k; j++) tmp[j] += bk, bk = tmp[j] / 10, tmp[j] %= 10;
		}
		bk = 1;
		for(ll j = 0; j < k; j++) {
			if(tmp[j] != 9) bk = 0;
		}
		a[i] = {0, 0, 0};
		if(bk) continue;
		for(int j = 0; j < 3; j++) {
			for(int l = k - 1; l >= 0; l--) a[i][j] = (a[i][j] * 10 + tmp[l]) % mod[j];
			mp[j][a[i][j]]++;
		}
	}
	arr kk = {0, 0, 0};
	for(ll i = 0; i < 3; i++) {
		for(int j = 0; j < k; j++) kk[i] = (kk[i] * 10 + 9) % mod[i];
	}
	ll ans = 0, cur;
	for(int m = 0; m < 3; m++) {
		for(ll i = 0; i < n; i++) {
			for(ll j = i; j < n; j++) {
				ans += mp[m][0 - a[i][m] - a[j][m]] + mp[m][kk[m] - a[i][m] - a[j][m]] + mp[m][2 * kk[m] % mod[m] - a[i][m] - a[j][m]];
			}
		}
	}
	cout << ans / 6 << "\n";
}