#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<random>
#include<chrono>
using namespace std;
#define int long long
int n,m,ans,cnt;
const int mod=(long long)(1e17)+9;
string s;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int w[501],a[20005];
inline int solve(string x)
{
    for(int i=0;i<m;++i)
    {
        a[i]=0;
        for(int j=i;j<x.length();j+=m)
            a[i]+=x[j]-'0';
    }
    for(;a[0]>=10;)
    {
        for(int j=0;j<m;++j)
        {
            a[j+1]+=a[j]/10;
            a[j]%=10;
        }
        a[0]+=a[m];
        a[m]=0;
    }
    int res=0;
    for(int j=m-1;j>=0;--j)
        res=(1ll*res*10%mod+a[j])%mod;
    return res;
}
inline void solve()
{
    int val1=0,val2=0,val3=0;
    for(int i=1;i<=m;++i)
        val1=(10ll*val1%mod+9)%mod;
    val2=(val1+val1)%mod,val3=(val1+val2)%mod;
    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])%mod==0||(w[i]+w[j]+w[k])%mod==val1||(w[i]+w[j]+w[k])%mod==val2||(w[i]+w[j]+w[k])%mod==val3;
}
inline void init()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
}
signed main()
{
    init();
    cin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        cin>>s;
        reverse(s.begin(),s.end());
        w[i]=solve(s);
    }
    solve();
    cout<<ans<<'\n';
    cout.flush();
    return 0;
}