#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=505;
const int mod[3]={998244353,1000000007,19260817};
poly a[N];
int n,m;
poly val[N];
poly md[3];
mt19937_64 rnd(time(0));
void BellaKira()
{
	cin>>n>>m;
	for (int i=1;i<=n;i++)
	{
		string st;
		cin>>st;
		reverse(st.begin(),st.end());
		a[i].resize(m);
		for (int j=0;j<sz(st);j++)
		{
			int o=j%m;
			a[i][o]+=st[j]-'0';
		}
		while (1)
		{
			bool bl=0,bl1=1;
			for (int j=0;j<m;j++)
				if (a[i][j]>9)
				{
					int t=a[i][j]/10;
					a[i][j]%=10;
					a[i][(j+1)%m]+=t;
					bl=1;
				}
			for (int j=0;j<m;j++)
				bl1&=(a[i][j]==9);
			if (bl1)
			{
				for (int j=0;j<m;j++) a[i][j]=0;
				a[i][0]=0;
			}
			if (!bl) break;
		}
		reverse(a[i].begin(),a[i].end());
		// for (auto u:a[i]) cout<<u<<",";
		// cout<<endl;
	}
	for (int i=0;i<3;i++) md[i]=poly(3,0);
	for (int i=1;i<=n;i++) val[i]=poly(3,0);
	for (int j=0;j<3;j++)
	{
		int op=1;
		for (int i=1;i<=m;i++) op=op*10%mod[j];
		op=(op+mod[j]-1)%mod[j];
		for (int i=0;i<3;i++)
			md[i][j]=op*i%mod[j];
		for (int i=1;i<=n;i++)
		{
			val[i][j]=0;
			for (auto u:a[i])
				val[i][j]=(val[i][j]*10+u)%mod[j];
		}
	}
	map<poly,int>F;
	int ans=0;
	for (int i=1;i<=n;i++)
	{
		F[val[i]]++;
		for (int j=i;j<=n;j++)
			for (int k=0;k<3;k++)
				if (!k||md[k]!=md[k-1])
				{
					poly now=md[k];
					for (int x=0;x<3;x++)
						now[x]=(now[x]-val[i][x]-val[j][x]+mod[x]+mod[x])%mod[x];
					ans=(ans+F[now]);
				}
	}
	cout<<ans<<'\n';
					




}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/