#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];
	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;
		}
		a[i] = {0, 0, 0};
		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];
		}
	}
	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(ll i = 0; i < n; i++) {
		for(ll j = i; j < n; j++) {
			for(ll k = j; k < n; k++) {
				for(ll l = 0; l < 3; l++) {
					cur = a[i][l] + a[j][l] + a[k][l];
					if(cur == 0 || cur == kk[l] || cur == 2 * kk[l] % mod[l] || cur == 3 * kk[l] % mod[l]) {
						ans++;
						break;
					}
				}
			}
		}
	}
	cout << ans << "\n";
}