#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> nd;

const ll P1 = 99999999999973ll;
const ll P2 = 999999999999989ll;

nd operator+(nd a, nd b) {
	return {a.first + b.first, a.second + b.second};
}

int n, k;
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	cin >> n >> k;
	vector<nd> V;

	for (int i = 0; i < n; i++) {
		string S;
		cin >> S;

		vector<int> a(k);
		for (int j = 0; j < S.size(); j++) {
			a[(S.size() - 1 - j) % k] += (S[j] - '0');
		}
		if (k == 1) {
			a[0] %= 9;
		}
		else {
			while (true) {
				bool flag = false;
				for (int i = 0; i < k; i++) {
					if (a[i] >= 10) {
						a[(i + 1) % k] += a[i] / 10;
						a[i] %= 10;
						flag = true;
					}
				}
				if (!flag) break;
			}
			bool flag = true;
			for (int i = 0; i < k; i++) {
				if (a[i] != 9) flag = false;
			}
			if (flag) {
				for (int &x : a) x = 0;
			}
		}
		ll h1 = 0, h2 = 0;
		for (int i = k - 1; i >= 0; i--) {
			h1 = (10 * h1 + a[i]) % P1;
			h2 = (10 * h2 + a[i]) % P2;
		}
		V.push_back({h1, h2});
	}
	sort(V.begin(), V.end());

	vector<nd> A;
	vector<int> B;
	for (int i = 0; i < V.size(); i++) {
		if (A.empty() || A.back() != V[i]) {
			A.push_back(V[i]);
			B.push_back(1);
		}
		else {
			B.back()++;
		}
	}

	int ans = 0;
	for (int d = 0; d <= 18; d += 9) {
		ll t1 = 0, t2 = 0;
		for (int i = 0; i < k; i++) {
			t1 = (10 * t1 + d) % P1;
			t2 = (10 * t2 + d) % P2;
		}
		for (int s = 0; s < 3; s++) {
			for (int q = 0; q < 3; q++) {
				nd t = {t1 + s * P1, t2 + q * P2};
				for (int i = 0; i < A.size(); i++) {
					for (int j = i, k = A.size() - 1; j <= k; j++) {
						while (k >= j && A[i] + A[j] + A[k] > t) --k;
						if (k < j) break;

						if (A[i] + A[j] + A[k] == t) {
							if (i == j && j == k) {
								ans += B[i] * (B[j] + 1) * (B[k] + 2) / 6;
							}
							else if (i == j) {
								ans += B[i] * (B[j] + 1) * B[k] / 2;
							}
							else if (j == k) {
								ans += B[i] * B[j] * (B[k] + 1) / 2;
							}
							else {
								ans += B[i] * B[j] * B[k];
							}
						}
					}
				}
			}
		}
	}
	cout << ans << '\n';
}