#include <bits/stdc++.h>
#define int long long 
#define rep(x, l, r) for(int x = l; x <= r; x++)
#define repd(x, r, l) for(int x = r; x >= l; x--)
using namespace std;
typedef unsigned long long ull;

const int mod1 = 1e6 +1231;
const int mod2 = 1e17 + 7;
const int MAXN = 505;
const int MAXM = 2e4 + 5;
int a[MAXN][MAXM];
ull h[MAXN], h1[MAXN], h2[MAXN];
char st[MAXM];

signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
#endif
	int n, m;
	scanf("%lld%lld", &n, &m);
	rep(i, 1, n){
		scanf("%s", st);
		int len = strlen(st);
		repd(j, len, 1){
			a[i][j] += st[len - j] - '0';
			if(j > m){
				a[i][j - m] += a[i][j];
				a[i][j] = 0;
			}
//				printf("%d ", a[i][j]);
		}
		
		rep(j, 1, m){
			a[i][j + 1] += a[i][j] / 10;
			a[i][j] %= 10;
		}
		while(a[i][m + 1]){
			a[i][1] += a[i][m + 1];
			a[i][m + 1] = 0;		
			rep(j, 1, m){
				a[i][j + 1] += a[i][j] / 10;
				a[i][j] %= 10;
			}
		}
//			puts("");
		repd(j, m, 1){
			h[i] = h[i] * 10 + a[i][j];
			h1[i] = (h1[i] * 10 + a[i][j]) % mod1;
			h2[i] = (h2[i] * 10 + a[i][j]) % mod2;
		}
//		printf("%d %d %d\n", h[i], h1[i], h2[i]);
	}
	ull c = 0, c1 = 0, c2 = 0;
	rep(i, 1, m){
		c = c * 10 + 9;
		c1 = (c1 * 10 + 9) % mod1;
		c2 = (c2 * 10 + 9) % mod2;
	}
	ull d = 2 * c, d1 = 2 * c1 % mod1, d2 = 2 * c2 % mod2;
	int ans = 0;
	rep(i, 1, n)
		rep(j, i, n)
			rep(k, j, n){
				if(h[i] + h[j] + h[k] == 0 && (h1[i] + h1[j] + h1[k]) % mod1 == 0 && (h2[i] + h2[j] + h2[k]) % mod2 == 0
				|| h[i] + h[j] + h[k] == c && (h1[i] + h1[j] + h1[k]) % mod1 == c1 && (h2[i] + h2[j] + h2[k]) % mod2 == c2
				|| h[i] + h[j] + h[k] == d && (h1[i] + h1[j] + h1[k]) % mod1 == d1 && (h2[i] + h2[j] + h2[k]) % mod2 == d2) ans++;
			}
	printf("%lld\n", ans);
	return 0;
}