#include<bits/stdc++.h>
using namespace std;
int n,k;
typedef unsigned long long ll;
constexpr ll mod=10000007998244353;
ll a[505];
int tmp[20005];
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        string s;cin>>s;reverse(s.begin(),s.end());
        for(int j=0;j<s.size();j++) tmp[j%k]+=s[j]-'0';
        int jw=0;
        do{
            for(int i=0;i<k;i++){
                tmp[i]+=jw;
                jw=tmp[i]/10;tmp[i]%=10;
            }
        }while(jw);
        for(int j=k-1;j>=0;j--) a[i]=(a[i]*10+tmp[j])%mod,tmp[j]=0;
    }
    ll w=9;
    for(int i=1;i<k;i++) w=(w*10+9)%mod;
    int ans=0;
    ll ww=(w+w)%mod;
    ll www=(w+ww)%mod;
    for(int i=1;i<=n;i++)
    for(int j=i;j<=n;j++)
    for(int k=j;k<=n;k++){
        ll z=(a[i]+a[j]+a[k])%mod;
        if(z==w||z==ww||z==www||!z) ans++;
    }
    cout<<ans<<'\n';
}