#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e5+5,M=N*50+5,K=1000+5,mod=1e9+9,Mod=mod-1;const db eps=1e-9;const ll INF=2e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,k,m;char s[N];
const ll m1=(ll)1e17+3,m2=(ll)1e17+31;
ll f1[N],f2[N];
void Solve(){
	int i,j,h;scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++){
		scanf("%s",s+1);m=strlen(s+1);
		for(j=1;j<=m;j++) s[j]-='0';for(j=m+1;j<=k;j++) s[j]=0;
		for(j=m;j>k;j--)while(s[j]){
			s[j-k]+=s[j];s[j]=0;
			int x=j-k;while(s[x]>=10) s[x+1]+=s[x]/10,s[x]%=10,x++;
		}
		for(j=k;j;j--){
			f1[i]=(f1[i]*10+s[j])%m1;
			f2[i]=(f2[i]*10+s[j])%m2;
			// gdb((int)s[j]);
		}
		// gdb(f1[j],f2[j]);
	}
	ll p1=1,p2=1;for(i=1;i<=k;i++) p1=p1*10%m1,p2=p2*10%m2;p1--;p2--;
	int ans=0;
	for(i=1;i<=n;i++)for(j=i;j<=n;j++)for(h=j;h<=n;h++){
		int o1=-1,o2=-1;
		ll w=(f1[i]+f1[j]+f1[h])%m1;
		if(w==0) o1=0;
		else if(w==p1) o1=1;
		else if(w==p1*2%m1) o1=2;
		else if(w==p1*3%m1) o1=3;
		w=(f2[i]+f2[j]+f2[h])%m2;
		if(w==0) o2=0;
		else if(w==p2) o2=1;
		else if(w==p2*2%m2) o2=2;
		else if(w==p2*3%m2) o2=3;
		if(~o1&&~o2&&o1==o2) ans++/*,gdb(i,j,h,o1,o2)*/;
	}
	printf("%d\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}