#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lowbit(x) (x&(-x))
#define pb emplace_back
#define pr pair<int,int>
#define let const auto
#define all(A) A.begin(),A.end()
void chkmin(int &x,int y){x=min(x,y);}
void chkmax(int &x,int y){x=max(x,y);}
const int N=1e5+5,M=505;
int read(){
	int x=0,f=1; char c=getchar();
	while(('0'>c||c>'9')&&c!='-') c=getchar();
	if(c=='-') f=0,c=getchar();
	while('0'<=c&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return f?x:-x;
}
const int m=3;
const int base[]={998244353,19260817,1000000009};
int n,k,b[M][3];
int mk[3][3];
char s[N];
int main(){
	n=read(),k=read();
	mk[1][0]=mk[1][1]=mk[1][2]=1;
	mk[2][0]=mk[2][1]=mk[2][2]=2;
	for(int i=1; i<=k; i++)
		for(int j:{0,1,2}) mk[1][j]=10ll*mk[1][j]%base[j],mk[2][j]=10ll*mk[2][j]%base[j];
	for(int j:{0,1,2}) mk[1][j]--,mk[2][j]=(mk[2][j]-2+base[j])%base[j];
	for(int i=1; i<=n; i++){
		scanf("%s",s+1);
		int l=strlen(s+1);
		vector <int> f(l);
		for(int i=l-1; ~i; i--) f[i]=s[l-i]-'0';
		auto made = [&](vector <int> &f){
			int n=f.size();
			vector <int> nw(k);
			for(int l=0,r; l<n; l=r+1){
				r=min(n-1,l+k-1);
				for(int i=l; i<=r; i++) nw[i-l]+=f[i];
			}
			f=nw;
			for(int i=0; i<(int)f.size(); i++){
				int x=f[i]/10;
				f[i]%=10;
				if(x){
					if(i+1==(int)f.size()) f.push_back(x);
					else f[i+1]+=x;
				}
				
			}
		};
		while((int)f.size()>k) made(f);
		auto chk = [&](){
			for(auto v:f) if(v!=9) return 0;
			return 1;
		};
		if(chk()) f={0};
		auto solve = [&](int mod){
			int cur=0;
			for(int i=(int)f.size()-1; ~i; i--)
				cur=(10ll*cur+f[i])%mod;
			return cur;
		};
		for(int j:{0,1,2}) b[i][j]=solve(base[j]);
	}
	int ans=0;
	for(int i=1; i<=n; i++)
		for(int j=i; j<=n; j++)
			for(int k=j; k<=n; k++){
				auto chk = [&](int *s){
					for(int t:{0,1,2}) 
						if((1ll*b[i][t]+b[j][t]+b[k][t])%base[t]!=s[t])
							return 0;
					return 1;
				};
				ans+=chk(mk[0]);
				ans+=chk(mk[1]);
				ans+=chk(mk[2]);
			}
	printf("%d\n",ans);
	return 0;
}