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

const int MAXN = 2e4 + 5;
int n, m;
int son[MAXN * 500][9];
int cnt[MAXN * 500];
int tot = 1, ans = 0;
char s[MAXN];
int sr[MAXN];

void ins() {
	int x = 1;
	for (int i = 0; i < m; ++i) {
		if (!son[x][sr[i]]) son[x][sr[i]] = ++tot;
		x = son[x][sr[i]];
	}
	++cnt[x];
}

void dfs (int dep, int x, int p) {
	if (dep == m) { 
		ans += cnt[x] * cnt[p];
		if (x == p) ans += cnt[x] * cnt[p];
		//cout << x << " " << p << endl;
		return ;
	}
	if (!x || !p) return ;
	for (int i = 0; i < 9; ++i)
		if (son[x][i] && son[p][(9 - (sr[dep] + i) % 9) % 9]) 
			dfs (dep + 1, son[x][i], son[p][(9 - (sr[dep] + i) % 9) % 9]);
}

int main() {
	int i,j,k;
	scanf ("%d%d", &n, &m);
	for (i = 1; i <= n; ++i) {
		scanf ("%s", s), k = strlen (s);
		for (j = 0; j < m; ++j) sr[j] = 0;
		for (j = 0; j < k; ++j)
			sr[j % m] += s[j] - '0';
		for (j = 0; j < m; ++j) sr[j] %= 9;
		//cout << sr[0] << endl;
		ins();
		dfs (0, 1, 1);
		//cout << ans << endl;
	}
	//cout << tot << endl;
	ans /= 2;
	printf ("%d", ans);
	return 0;
}