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

typedef long long ll;

const int N = 505;
const ll mod1 = 100000000000000337;
const ll mod2 = 100000000000000423;

ll n, k, p1, q1, p2, q2, ans, a[N], b[N];

string s[N];

inline void mod(string &s) {
	if ((int)s.size() <= k) {
		return;
	}
	vector <string> vec;
	string t = "";
	for (int i = 0; i < (int)s.size(); ++i) {
		t += s[i];
		if ((int)t.size() == k) {
			vec.emplace_back(t);
			t = "";
		}
	}
	for (auto S: vec) {
		while (t.size() < S.size()) {
			t += "0";
		}
		while (S.size() < t.size()) {
			S += "0";
		}
		int j = 0;
		for (int i = 0; i < (int)S.size(); ++i) {
			int u = S[i] - '0' + t[i] - '0' + j;
			if (u >= 10) {
				u -= 10;
				j = 1;
			} else {
				j = 0;
			}
			t[i] = u + '0';
		}
		if (j) {
			t += "1";
		}
	}
	mod(t);
	s = t;
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> s[i];
		reverse(s[i].begin(), s[i].end());
		mod(s[i]);
		reverse(s[i].begin(), s[i].end());
		for (auto ch: s[i]) {
			a[i] = ((__int128)a[i] * 10 + (ch - '0')) % mod1;
			b[i] = ((__int128)b[i] * 10 + (ch - '0')) % mod2;
		}
	}
	for (int i = 1; i <= k; ++i) {
		p1 = ((__int128)p1 * 10 + 9) % mod1;
		q1 = ((__int128)q1 * 10 + 9) % mod2;
	}
	p2 = p1 * 2 % mod1;
	q2 = q1 * 2 % mod2;
	for (int i = 1; i <= n; ++i) {
		for (int j = i; j <= n; ++j) {
			for (int k = j; k <= n; ++k) {
				ll s = (a[i] + a[j] + a[k]) % mod1;
				ll t = (b[i] + b[j] + b[k]) % mod2;
				if ((s == 0 && t == 0) || (s == p1 && t == q1) || (s == p2 && t == q2)) {
					++ans;
				}
			}
		}
	}
	cout << ans << "\n";
	return 0;
}