#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<random>
#include<chrono>
using namespace std;
int n,m,ans,cnt;
long long base;
string s;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
string a[501],tmp,M;
int w[501];
inline string operator +(string x,string y)
{
    string res;
    reverse(x.begin(),x.end());
    reverse(y.begin(),y.end());
    res.resize(max(x.length(),y.length()));
    long long d=0;
    for(int i=0;i<res.length();++i)
    {
        res[i]=d;
        if(i<x.length())
            res[i]+=x[i];
        if(i<y.length())
            res[i]+=y[i];
        d=res[i]/10;
        res[i]%=10;
    }
    if(d)
        res.push_back(d);
    reverse(res.begin(),res.end());
    return res;
}
inline string operator -(string x,string y)
{
    string res=x;
    long long d=0;
    reverse(x.begin(),x.end());
    reverse(y.begin(),y.end());
    for(int i=0;i<res.length();++i)
    {
        res[i]-=d;
        if(i<y.length())
            res[i]-=y[i];
        d=0;
        if(res[i]<0)
        {
            res[i]+=10;
            d=10;
        }
    }
    while(!res.empty()&&!res.back())
        res.pop_back();
    reverse(res.begin(),res.end());
    return res;
}
inline int operator %(string x,const int y)
{
    string res=x;
    long long d=0;
    reverse(x.begin(),x.end());
    for(int i=0;i<res.length();++i)
        d=(d*10+x[i])%y;
    return d;
}
inline string solve(string x)
{
    while(x.length()>M.length())
    {
        if(x==M)
        {
            x.clear();
            return x;
        }
        tmp.clear();
        for(int i=1;i<=m;++i)
        {
            tmp.push_back(x.back());
            x.pop_back();
        }
        reverse(tmp.begin(),tmp.end());
        x=x+tmp;
    }
    if(x.length()==1&&!x[0])
    {
        x.clear();
        return x;
    }
    return x;
}
inline void solve()
{
    int now=998244853,val1=M%now,val2=(M+M)%now;
    for(int i=1;i<=n;++i)
        w[i]=a[i]%now;
    for(int i=1;i<=n;++i)
        for(int j=i;j<=n;++j)
            for(int k=j;k<=n;++k)
                ans+=(w[i]+w[j]+w[k])%now==0||(w[i]+w[j]+w[k])%now==val1||(w[i]+w[j]+w[k])==val2;
}
inline void init()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
}
int main()
{
    init();
    cin>>n>>m;
    for(int i=1;i<=m;++i)
        M.push_back(9);
    for(int i=1;i<=n;++i)
    {
        cin>>a[i];
        for(int j=0;j<a[i].length();++j)
            a[i][j]-='0';
        a[i]=solve(a[i]);
    }
    solve();
    cout<<ans<<'\n';
    cout.flush();
    return 0;
}