#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
typedef __int128 i128;
const int N=510;
const int M=20010;
const ll mod=10000000000002137;
int n,m;
char str[M];
vi a[N];
void redu(vi &vec){
	int len=vec.size();
	for(int i=m;i<len;i++)vec[i%m]+=vec[i];
	vec.resize(m);
	for(int i=0;i<m;i++){
		if(vec[i]>=10){
			if(i==m-1)vec.pb(0);
			vec[i+1]+=vec[i]/10;
			vec[i]%=10;
		}
	}
	int t=m;
	while((int)vec.size()>t&&vec[t]>=10){
		vec.pb(vec[t]/10);
		vec[t]%=10;
	}
}
ll calc(vi vec){
	int len=vec.size();
	ll s=0;
	for(int i=len-1;i>=0;i--)s=(s*10+vec[i])%mod;
	return s;
}
ll b[N];
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,m);
	for(int i=1;i<=n;i++){
		scanf("%s",str+1);
		int len=strlen(str+1);
		for(int j=len;j>=1;j--)a[i].pb(str[j]-'0');
		while((int)a[i].size()>m)redu(a[i]);
		int fl=1;
		for(int j=0;j<(int)a[i].size();j++)if(a[i][j]!=9)fl=0;
		if(fl==1&&(int)a[i].size()==m){
			vi().swap(a[i]);
			a[i].pb(0);
		}
	}
	for(int i=1;i<=n;i++)b[i]=calc(a[i]);
	ll b1=0,b2=0,b3=0;
	for(int i=1;i<=m;i++)b2=(b2*10+9)%mod;
	b3=b2*2%mod;
	int ans=0;
	for(int i=1;i<=n;i++)
		for(int j=i;j<=n;j++)
			for(int k=j;k<=n;k++)
				if((b[i]+b[j]+b[k])%mod==b3||(b[i]+b[j]+b[k])%mod==b1||(b[i]+b[j]+b[k])%mod==b2)
					++ans;
	cout<<ans<<'\n';
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}