#include<bits/stdc++.h>
using namespace std;
#define maxn 20010
typedef unsigned long long ull;
const ull MAX= 1e16,base=233;
const int B= 16;
int n,k;
int tmp[maxn],tmp2[maxn],cnt,cc;
ull bas[maxn];
struct node{
	ull a[1251],len;
	const node operator +(const node &b)const{
		node ret;
		ret.len=max(len,b.len);
		int res=0;
		for(int i=1;i<=ret.len;i++){
			ret.a[i]=b.a[i]+a[i];
			res=ret.a[i]/MAX;
			ret.a[i]-=res*MAX;
		}
		if(res){
			ret.a[++ret.len]=res;
		}
		return ret;
	}
	pair<ull,ull> Make_Hash(){
		ull ret1=0,ret2=0;
		for(int i=1;i<=len;i++)ret1^=a[i]*bas[i],ret2+=a[i]*bas[i];
		return {ret1,ret2};
	}
	void read(){
		len=0;
		char c=getchar();
		while(c<'0'||c>'9')c=getchar();
		cnt=0;
		while(c>='0'&&c<='9'){
			tmp2[++cnt]=c-'0';
			c=getchar();
		}
		
		reverse(tmp2+1,tmp2+cnt+1);
		for(int i=1;i<=k+1;i++)tmp[i]=0;
		for(int i=0;i<cnt;i++)tmp[i%k+1]+=tmp2[i+1];
		
		do{
			tmp[1]+=tmp[k+1];
			tmp[k+1]=0;
			for(int i=1;i<=k;i++){
				tmp[i+1]+=tmp[i]/10;
				tmp[i]%=10;
			}
			cnt=k;
		}while(tmp[k+1]);
	//	cout<<tmp[1]<<endl;
		int s=0;
		for(int i=1;i<=k;i++)s+=tmp[i];
		if(!s){
			cc++;
	//		cout<<"???"<<endl;
		}
		if(!s)cc++;
		if(s==9*k){
			//cout<<"???"<<endl;
			cc++;
			for(int i=1;i<=k;i++)tmp[i]=0;
		}
		len=0;
		ull t=1;
		for(int i=1;i<=k;i++,t*=10){
			if(i%B==1||B==1)len++,t=1;
			a[len]=(a[len]+tmp[i]*t);
		}
		return ;
	}
	void Cout(){
		for(int i=len;i;i--)cout<<a[i];
		cout<<endl;
	}
}b[2010],temp1,temp2;
inline int read(){
	int ret=0,flg=0;
	char c=getchar();
	while(c<'0'||c>'9')flg|=c=='-',c=getchar();
	while(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',c=getchar();
	return flg?-ret:ret;
}
inline void write(int x,bool flg){
	char a[21];
	if(!x)putchar('0');
	if(x<0)putchar('-'),x=-x;
	int cnt=0;
	while(x){
		a[++cnt]=x%10+'0';
		x/=10;
	}
	while(cnt)putchar(a[cnt--]);
	putchar(flg?'\n':' ');
	return ;
}
const int mod = 19260817;
int he[19260817],sz[maxn],nxt[maxn],tot;
pair<ull,ull> val[maxn];
void add(int x,pair<ull,ull> &u){
	for(int i=he[x];i;i=nxt[i]){
		if(val[i]==u){
			sz[i]++;
			return ;
		}
	}
	val[++tot]=u,sz[tot]=1,nxt[tot]=he[x],he[x]=tot;
	return ;
}
node o;
ull ten[21];
int main(){
	n=read(),k=read();
	bas[0]=1;
	for(int i=1;i<=1255;i++)bas[i]=bas[i-1]*base;
	o.len=(k+B-1)/B;
	ten[0]=1;
	for(int i=1;i<=B;i++)ten[i]=ten[i-1]*10;
	for(int i=1;i<o.len;i++)o.a[i]=MAX-1;
	if(k%B==0)o.a[o.len]=MAX-1;
	else o.a[o.len]=ten[k%B]-1;
	for(int i=1;i<=n;i++){
		b[i].read();
	//	b[i].Cout();
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		temp1.len=o.len;
		for(int j=1;j<=o.len;j++)temp1.a[j]=o.a[j]-b[i].a[j];
		pair<ull,ull> t=temp1.Make_Hash();
	//	temp1.Cout();
		add((t.first*233+t.second)%mod,t);
		temp2=temp1+o;
	//	temp2.Cout();
		t=temp2.Make_Hash();
		add((t.first*233+t.second)%mod,t);
		for(int j=i;j<=n;j++){
			temp1=b[i]+b[j];
			t=temp1.Make_Hash();
			//cout<<"FUCK"<<endl;
			//temp1.Cout();
			int x=(t.first*233+t.second)%mod;
			for(int l=he[x];l;l=nxt[l]){
				if(val[l]==t)
					ans+=sz[l];
			}
		}
	//	cout<<ans<<endl;
	}//cout<<cc<<"ee"<<endl;
	ans+=cc*(cc+1)*(cc+2)/6;
	write(ans,1);
	return 0;
}