#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=505;
const int maxk=20010;

const int mod1=10000079;
const int mod2=100000037;
const int mod3=1000000097;

int n,k;
int m[maxn];
int a[maxn][maxk];
int h1[maxn],h2[maxn],h3[maxn];
int mh1=0,mh2=0,mh3=0;
int m2h1=0,m2h2=0,m2h3=0;

int main(){
	ios::sync_with_stdio(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		m[i]=s.length();
		for(int j=m[i]-1;j>=0;j--){
			a[i][m[i]-j]=s[j]-'0';
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=m[i];j>k;j--){
			a[i][j-k]+=a[i][j];
			a[i][j]=0;
		}
		do{
			for(int j=1;j<=k;j++){
				a[i][j+1]+=a[i][j]/10;
				a[i][j]%=10;
			}
			a[i][1]+=a[i][k+1];
			a[i][k+1]=0;
		}
		while(a[i][1]>9);
		bool flag=1;
		for(int j=1;j<=k;j++)
			if(a[i][j]!=9){
				flag=0;
				break;
			}
		if(flag)
			for(int j=1;j<=k;j++)
				a[i][j]=0;
	}
	for(int i=1;i<=n;i++){
		for(int j=k;j>=1;j--){
			h1[i]=((ll)h1[i]*10+a[i][j])%mod1;
			h2[i]=((ll)h2[i]*10+a[i][j])%mod2;
			h3[i]=((ll)h3[i]*10+a[i][j])%mod3;
		}
	}
	
	for(int i=1;i<=k;i++){
		mh1=((ll)mh1*10+9)%mod1;
		mh2=((ll)mh2*10+9)%mod2;
		mh3=((ll)mh3*10+9)%mod3;
	}
	
	m2h1=mh1*2%mod1;
	m2h2=mh2*2%mod2;
	m2h3=mh3*2%mod3;
	
	int cnt=0;
	for(int x=1;x<=n;x++)
		for(int y=x;y<=n;y++)
			for(int z=y;z<=n;z++){
				int sh1=((ll)h1[x]+h1[y]+h1[z])%mod1;
				int sh2=((ll)h2[x]+h2[y]+h2[z])%mod2;
				int sh3=((ll)h3[x]+h3[y]+h3[z])%mod3;
				if((sh1==0||sh1==mh1||sh1==m2h1)&&(sh2==0||sh2==mh2||sh2==m2h2)&&(sh3==0||sh3==mh3||sh3==m2h3))
					cnt++;
			}
	cout<<cnt<<endl;
	return 0;
}