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

#define int     long long
#define pb      push_back
#define sz(x)   (int)(x.size())
#define fs      first
#define sc      second
#define all(x)  (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mid     (L + R) / 2

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef __int128_t int128;

mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n, k;
const vi Mods = {1'000'000'009, 2'000'000'099};

struct Hash {
	vi H;
	Hash() { H.assign(2, 0); }
	Hash(int a) { H.assign(2, a); }
	Hash(vi F) : H(F) {}

	Hash operator-(Hash A) {
		vi Nas(2);
		for (int i = 0; i < 2; i++) {
			Nas[i] = (H[i] + Mods[i] - A.H[i]);
			if (Nas[i] >= Mods[i])
				Nas[i] -= Mods[i];
			if (Nas[i] >= Mods[i])
				Nas[i] -= Mods[i];
		}
		return Hash{Nas};
	}
	Hash operator+(Hash A) {
		vi Nas(2);
		for (int i = 0; i < 2; i++) {
			Nas[i] = (H[i] + A.H[i]);
			if (Nas[i] >= Mods[i])
				Nas[i] -= Mods[i];
		}
		return Hash{Nas};
	}
	Hash operator+(int a) {
		vi Nas(2);
		for (int i = 0; i < 2; i++) {
			Nas[i] = (H[i] + a);
			if (Nas[i] >= Mods[i])
				Nas[i] -= Mods[i];
		}
		return Hash{Nas};
	}
	Hash operator*(int mul) {
		vi Nas(2);
		for (int i = 0; i < 2; i++) {
			Nas[i] = (H[i] * mul) % Mods[i];
		}
		return Hash{Nas};
	}
	bool operator==(Hash A) {
		for (int i = 0; i < 2; i++) {
			if (A.H[i] != H[i])
				return false;
		}
		return true;
	}
};

void problem() {
	scanf("%lld %lld", &n, &k);
	vector<Hash> A;
	char ss[(int)(2e4 + 5)];
	for (int i = 0; i < n; i++) {
		scanf("%s", ss);
		string s = string(ss);
		reverse(all(s));
		vi F(k);
		for (int j = 0; j < sz(s); j++) {
			F[j % k] += s[j] - '0';
		}
		int cant = (sz(s) + k - 1) / k + 1;
		while (cant--) {
			bool ok = true;
			for (int j = 0; j < k; j++) {
				int extra = F[j] / 10;
				F[j] %= 10;
				F[(j + 1) % k] += extra;
				if (extra)
					ok = false;
			}
			if (ok)
				break;
		}
		Hash Num;
		for (int j = 0; j < k; j++) {
			Num = Num * 10;
			Num = Num + F[j];
		}
		A.pb(Num);
	}

	vector<Hash> Ans;
	Ans.pb(Hash());
	Hash Num;
	for (int i = 0; i < k; i++) {
		Num = Num * 10;
		Num = Num + 9;
	}
	Ans.pb(Num);
	Num = Num * 2;
	Ans.pb(Num);
	map<vi, int> M;
	int ans = 0;
	for (int i = 0; i < n; i++) {
		M[A[i].H]++;
		vector<Hash> Sum = Ans;
		for (int h = 0; h < 3; h++) {
			Sum[h] = Sum[h] - A[i];
		}
		for (int j = i; j < n; j++) {
			for (int h = 0; h < 3; h++) {
				ans += M[(Sum[h] - A[j]).H];
			}
		}
	}
	printf("%lld\n", ans);
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tc = 1;
	// cin>>tc;
	while (tc--) {
		problem();
		// cout << "\n";
	}
}