#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

constexpr ll mod=75414728885444537LL;
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N,K;
  cin>>N>>K;
  auto INPUT=[&]()->ll{
    string s;
    cin>>s;
    vector<int>a(s.size());
    rep(i,(int)s.size())a[i]=s[i]-'0';
    reverse(a.begin(),a.end());
    while(true){
      int n=a.size();
      vector<int>b(n,0);
      rep(i,n)b[i%K]+=a[i];
      rep(i,n-1){
        b[i+1]+=b[i]/10;
        b[i]%=10;
      }
      while(b.size()>1&&b.back()==0)b.pop_back();
      a=b;
      if(a.size()<=K)break;
    }
    // print(a);
    if(a.size()==K){
      bool flag=true;
      rep(i,K){
        if(a[i]!=9)flag=false;
      }
      if(flag)a={0};
    }
    ll val=0;
    reverse(a.begin(),a.end());
    for(auto x:a){
      val=(val*10+x)%mod;
    }
    // print(s,stoi(s)%99,val);
    return val;
  };

  vector<ll>A(N);
  rep(i,N)A[i]=INPUT();
  ll ans=0;

  ll X=0;
  rep(K){
    X=(10*X+9)%mod;
  }
  rep(i,N)rep(j,i,N)rep(k,j,N){
    ll sm=(A[i]+A[j]+A[k])%mod;
    if(sm==0LL||sm==X%mod||sm==(2*X)%mod)ans++;
  }
  print(ans);
}