#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>

#define X first
#define Y second
#define PB push_back

using namespace std;

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

const int N = 1e5 + 500;

const int MOD1 = 1000000103;
const int MOD2 = 1000000207;

inline int add(int A, int B, int MOD) {
	if(A + B >= MOD)
		return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B, int MOD) {
	if(A - B < 0)
		return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B, int MOD) {
	return (ll)A * B % MOD;
}

inline pii add(pii A, pii B) { return  {add(A.X, B.X, MOD1), add(A.Y, B.Y, MOD2)}; }
inline pii mul(pii A, pii B) { return  {mul(A.X, B.X, MOD1), mul(A.Y, B.Y, MOD2)}; }
inline pii sub(pii A, pii B) { return  {sub(A.X, B.X, MOD1), sub(A.Y, B.Y, MOD2)}; }

int num[N], n, K;

void ubaci(int x, int y) {
	num[x] += y;
	while(num[x] >= 10) {
		num[x + 1] += num[x] / 10;
		num[x++] %= 10;
	}
}

pii reduce() {
	for(int i = N - 1;i >= K;i--) {
		while(num[i] > 0) {
			int t = num[i];
			num[i] = 0;
			ubaci(i % K, t);
		}
	}
	int sve9 = 1;
	for(int i = 0;i < K;i++) sve9 &= num[i] == 9;
	if(sve9) {
		return {0, 0};
	}
	pii cur = {0, 0};
	for(int i = 0;i < K;i++)
		cur = add(mul({10, 10}, cur), {num[i], num[i]});
	return cur;
}

pii hsh[N];
map < pii, int > cnt;


int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> K;
	int nule = 0;
	for(int i = 0;i < n;i++) {
		string s; cin >> s;
		memset(num, 0, sizeof(num));
		for(int j = 0;j < (int)s.size();j++)
			num[(int)s.size() - j - 1] = s[j] - '0';
		hsh[i] = reduce();
		nule += hsh[i] == (pii){0, 0};
	}
	int ans = nule * (nule + 1) * (nule + 2) / 6;
	pii M = {0, 0};
	for(int j = 0;j < K;j++) {
		M = add(mul({10, 10}, M), {9, 9});
	}
	for(int j = 0;j < n;j++) {
		cnt[hsh[j]]++;
		for(int k = j;k < n;k++) {
			ans += cnt[sub(M, add(hsh[j], hsh[k]))];
			ans += cnt[sub(add(M, M), add(hsh[j], hsh[k]))];
		}
	}
	cout << ans << '\n';
	return 0;
}