#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n,k,ans;
const int N=505;
const ll mod=(ll)(1e17)+7;
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
ll a[N];
ll get(string s){
    reverse(s.begin(),s.end());
    ll sum=0;
    for(int i=0;i<s.length();i+=k){
        ll dq=0;
        For(j,i,min((int)s.length()-1,i+k-1)){
            dq=(dq*10+s[j]-'0')%mod;
        }
        sum=(sum+dq)%mod;
    }
    return sum;
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin>>n>>k;
    For(i,0,n-1){
        string s;
        cin>>s;
        a[i]=get(s);
        //cerr<<a[i]<<endl;
    }
    ll ald=0;
    For(i,0,k-1)ald=(ald*10+9)%mod;
    For(i,0,n-1)For(j,i,n-1)For(k,j,n-1){
        ll t=(a[i]+a[j]+a[k])%mod;
        if(t==ald||t==0||t==ald*2%mod)ans++;
    }
    cout<<ans<<endl;
    return 0;
}