#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
const int MOD1=998244353;
const int MOD2=1e9+7;
int n,k;
int a[505][20005];char c[20005];
ll hs1[505],hs2[505];
ll r1,r2;
ll ksm(ll a,int b,int MOD){ll r=1;while(b){if(b&1)r=r*a%MOD;a=a*a%MOD,b>>=1;}return r;}
void read(int *a){
	cin>>c;int len=strlen(c);
	for(int i=0;i<len;i++) a[i]=c[len-1-i]-'0';
	for(int i=len-1;i>=k;i--){
		while(a[i]){
			a[i-k]+=a[i];a[i]=0;
			int p=i-k;
			while(a[p]>=10){
				a[p]-=10;a[++p]++;
			}
		}
	}
	bool flag=true;
	for(int i=0;i<k;i++) if(a[i]!=9) flag=false;
	if(flag) memset(a,0,sizeof(a));
	return;
}
int main(){
	ios::sync_with_stdio(false);
	// freopen("Otomachi_Una.in","r",stdin);
	// freopen("Otomachi_Una.out","w",stdout);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		read(a[i]);
		for(int j=k;j>=0;j--){
			hs1[i]=(hs1[i]*10+a[i][j])%MOD1;
			hs2[i]=(hs2[i]*10+a[i][j])%MOD2;
		}
	}
	r1=ksm(10,k,MOD1)-1,r2=ksm(10,k,MOD2)-1;
	int ans=0;
	for(int i=1;i<=n;i++) for(int j=i;j<=n;j++) for(int k=j;k<=n;k++)
		for(int o=0;o<=2;o++) if((hs1[i]+hs1[j]+hs1[k])%MOD1==o*r1%MOD1
			&&(hs2[i]+hs2[j]+hs2[k])%MOD2==o*r2%MOD2){
				ans++;
			}
	cout<<ans<<'\n';
	cerr<<"Running time: "<<1.*clock()/CLOCKS_PER_SEC<<'\n';
	return 0;
}