#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

ll cmod(ll x,ll P){if(x>=P)x-=P;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const ll P1=1e17-3;
const ll P2=2e17+3;
const ll P3=3e17+11;
struct Has{
	ll val1,val2,val3;
	void init(vector<int>S){
		ll res=0;
//		cout<<"init S = ";for(int x:S)cout<<x<<" ";puts("");
		for(int i=0;i<S.size();i++)res=(1ll*res*10+S[i])%P1;
		val1=res,res=0;
		for(int i=0;i<S.size();i++)res=(1ll*res*10+S[i])%P2;
		val2=res,res=0;
		for(int i=0;i<S.size();i++)res=(1ll*res*10+S[i])%P3;
		val3=res,res=0;
//		cout<<"val1,val2,val3 = "<<val1<<" "<<val2<<" "<<val3<<endl;
	}
	Has(ll v1=0,ll v2=0,ll v3=0):val1(v1),val2(v2),val3(v3){}
};
Has operator+(Has A,Has B){return Has(cmod(A.val1+B.val1,P1),cmod(A.val2+B.val2,P2),cmod(A.val3+B.val3,P3));}
bool operator==(Has A,Has B){return A.val1==B.val1&&A.val2==B.val2&&A.val3==B.val3;}

const int N=505;
int n,k,M;
Has a[N];
map<Has,int>Map;

signed main(void){

	cin>>n>>k;

	vector<int>vec;
	for(int i=1;i<=k;i++)vec.emplace_back(9);
	Has M0,M1,M2,M3;
	M0.init(vector<int>()),M1.init(vec),M2=M1+M1,M3=M2+M1;
	
//	cout<<"M1 = "<<M1.val1<<" "<<M1.val2<<" "<<M1.val3<<endl;
//	cout<<"M2 = "<<M2.val1<<" "<<M2.val2<<" "<<M2.val3<<endl;
	
	for(int t=1;t<=n;t++){
		string str="";
		cin>>str;int W=50;
		int R=0;for(int i=0;i<str.size();i++)R=(R*10+str[i]-'0')%9;
		vector<int>val(k+W);
		reverse(str.begin(),str.end());
		for(int i=0;i<str.size();i++)val[i%k]+=str[i]-'0';
//		cout<<"now val = "<<val[0]<<endl;
		for(int i=0;i+1<k+W;i++)val[i+1]+=val[i]/10,val[i]%=10;
		while(1){
			bool chk=0;
			for(int i=k;i<k+W;i++)val[i%k]+=val[i],chk|=(val[i]!=0),val[i]=0;
			for(int i=0;i+1<k+W;i++)val[i+1]+=val[i]/10,val[i]%=10;
			if(!chk)break;	
		}
		reverse(val.begin(),val.end());
		a[t].init(val);
//		cout<<"a "<<t<<" = "<<a[t].val1<<" "<<a[t].val2<<" "<<a[t].val3<<endl;
//		if(a[t].val1!=R){puts("???");}
	}
	
	int cnt=0;
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j++)for(int k=j;k<=n;k++){
		if(a[i]+a[j]+a[k]==M0||a[i]+a[j]+a[k]==M1||a[i]+a[j]+a[k]==M2||a[i]+a[j]+a[k]==M3)cnt++;
	}
	cout<<cnt<<endl;

	return 0;
}