#include <bits/stdc++.h>
using namespace std;
const int N=505,mod[]={998244353,19260817,1000000009};
int n,K,ans,c[3][3],m[N][3];
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>K;
	for(int id=0;id<n;id++){
		string s;
		cin>>s;
		int l=s.size();
		vector<int> f;
		for(int i=0;i<l;i++) f.push_back(s[i]-'0');
		reverse(begin(f),end(f));
		while(1){
			l=f.size();
			if(l<=K){
				if(count(begin(f),end(f),9)==K) f=vector<int>(K,0);
				break;
			}
			vector<int> g(K);
			for(int i=0;i<l;i+=K) for(int j=i;j<l&&j<i+K;j++) g[j-i]+=f[j];
			for(int i=0;i<(int)g.size();i++){
				int t=g[i]/10;g[i]%=10;
				if(!t) continue;
				if(i+1==(int)g.size()) g.push_back(0);
				g[i+1]+=t;
			}
			swap(f,g);
		}
		for(int i=K-1;~i;i--) for(int o:{0,1,2}) m[id][o]=(10ll*m[id][o]+f[i])%mod[o];
	}
	c[1][0]=c[1][1]=c[1][2]=1;
	for(int i=0;i<K;i++) for(int u:{0,1}) for(int o:{0,1,2}) c[u][o]=(10ll*c[u][o]+9-(u==1&&i==K-1))%mod[o];
	for(int i=0;i<n;i++) for(int j=0;j<=i;j++) for(int k=0;k<=j;k++) for(int u:{0,1,2}){
		int fl=1;
		for(int o:{0,1,2})
			if((1ll*m[i][o]+m[j][o]+m[k][o])%mod[o]!=c[u][o]) {fl=0;break;}
		ans+=fl;
	}
	cout<<ans;
	return 0;
}