//#pragma GCC optimize(2,3,"Ofast","inline", "-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<ctime>
#include<map>
#include<random>
#include<unordered_map>
#include<set>
#include<queue>
#include<vector>
#include<cmath>
#include <cassert>
#include<bitset>
#define fi first
#define se second
#define pb push_back
#define y1 hsduaishxu
#define mkp make_pair
using namespace std;
typedef long long ll;
typedef double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<ll,ll> pll;
typedef unsigned int uint;
typedef vector<pii> vpii;
const int maxn=10000005;
const ll mod=10000000000313;
inline int Min(int x,int y){return x<y?x:y;}
inline int Max(int x,int y){return x>y?x:y;}
inline ll Min(ll x,ll y){return x<y?x:y;}
inline ll Max(ll x,ll y){return x>y?x:y;}
inline void ad(int &x,int y,int z){x=y+z;if(x>=mod) x-=mod;}
inline void ad(ll &x,ll y,ll z){x=y+z;if(x>=mod) x-=mod;}
inline void ad(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void ad(int &x,ll y){x+=y;if(x>=mod) x-=mod;}
inline void ad(ll &x,ll y){x+=y;if(x>=mod) x-=mod;}
inline void siu(int &x,int y,int z){x=y-z;if(x<0) x+=mod;}
inline void siu(int &x,int y){x-=y;if(x<0) x+=mod;}
inline void siu(ll &x,ll y){x-=y;if(x<0) x+=mod;}
inline ll myabs(ll x){return x<0?-x:x;}
inline void tmn(int &x,int y){if(y<x) x=y;}
inline void tmx(int &x,int y){if(y>x) x=y;}
inline void tmn(ll &x,ll y){if(y<x) x=y;}
inline void tmx(ll &x,ll y){if(y>x) x=y;}
ll qpow(ll aa,ll bb){ll res=1;while(bb){if(bb&1) res=res*aa%mod;aa=aa*aa%mod;bb>>=1;}return res;}
inline ll Inv(ll x){return qpow(x,mod-2);}
int _,__;
int n,K;
ll h[505];
int p[100005],len;
map<int,int> mp;
void sve()
{
	int s=0;
	for(int i=1;i<=K+10&&i<=len;i++)
	{
		if(i<=K) for(int j=i;j<=len;j+=K) s+=p[j];
		p[i]=s%10;s/=10;
	}
	for(int i=Min(K+10,len);i>=1;i--) if(p[i]||i==1) return len=i,void();
}
void solve()
{
	cin>>n>>K;
	for(int i=1;i<=n;i++)
	{
		string s;cin>>s;len=s.length();
		memset(p,0,sizeof(p));
		for(int j=1;j<=len;j++) p[j]=s[len-j]-'0';
		while(len>K) sve();
		ll nw=1;
		for(int j=1;j<=len;j++) ad(h[i],nw*p[j]%mod),nw=nw*10%mod;
	}
	ll s=1;
    for(int i=1;i<=K;i++) s=s*10%mod;
    s--;
	ll ans=0;
	for(int j=n;j>=1;j--)
	{
		mp[h[j]]++;
		for(int i=1;i<=j;i++)
		{
			for(int k=0;k<=3;k++) ans+=mp[(k*s+2*mod-h[j]-h[i])%mod];
		}
	}
	cout<<ans<<"\n";
}
signed main()
{
    //freopen("eternity3.in","r",stdin);
	//freopen("test.out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	_=1;
	//cin>>_;
    while(_--)
    {
    	solve();
	}
	return 0;
}