#include<bits/stdc++.h>
using namespace std;
#define int long long
const int M=1e9+9;

int ans,n,k,mod,a[510],b[20010];
string s;

int getnum(){
	cin>>s;
	int len=s.length();
	for(int i=0;i<len;++i)b[i]=s[len-i-1]-'0';
	while(len>k){
		for(int i=k;i<len;++i)b[i%k]+=b[i],b[i]=0;
		for(int i=0;i<len;++i)b[i+1]+=b[i]/10,b[i]%=10;
		while(len>0&&b[len-1]==0)len--;
	}
	int cnt=0;
	for(int i=len-1;i>=0;--i)cnt=(cnt*10+b[i])%M;
	if(cnt==mod)return 0;
	else return cnt;
}

void solve(){
	cin>>n>>k;
	mod=1;
	for(int i=1;i<=k;++i)mod=mod*10%M;
	mod=(mod-1+M)%M;
	for(int i=1;i<=n;++i)a[i]=getnum();
	ans=0;
	for(int i=1;i<=n;++i){
		for(int j=i;j<=n;++j){
			for(int k=j;k<=n;++k){
				int cnt=(a[i]+a[j]+a[k])%M;
				if(cnt==mod||cnt==0||cnt==(mod*2%M))ans++;
			}
		}
	}
	cout<<ans;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int __=1;
//	cin>>__;
    while(__--)solve();
    return 0;
}