#include<bits/stdc++.h>
using namespace std;const int N=2e6+7,q=1e9+7;
char t[N];int n,m,a[N],b[N],s[N],p[N],g[N],pre[N],suf[N];
long long sol(int *a,int n){
	int mid=0,r=0;long long ans=0;s[0]=s[1]=-1;s[2*n+2]=-2;
	for(int i=1;i<=n;++i)s[i*2]=a[i],s[i*2+1]=-1;
	for(int i=1;i<=2*n+1;++i){
		if(i<=r)p[i]=min(p[2*mid-i],r-i+1);else p[i]=0;
		while(s[i-p[i]]==s[i+p[i]])++p[i];
		if(p[i]+i>r)r=p[i]+i-1,mid=i;if(i&1)g[i/2]=p[i]/2;
	}
	pre[0]=1;for(int i=1;i<n;++i){
		int w=pre[i-1];if(i-g[i]>0)w-=pre[i-g[i]-1];
		pre[i]=pre[i-1]+(w>0);
	}
	suf[n]=1;ans=pre[n-1];
	for(int i=n-1;i;--i){
		int w=suf[i+1];if(i+g[i]<n)w-=suf[i+g[i]+1];
		if(w)ans+=pre[i-1];suf[i]=suf[i+1]+(w>0);
	}
	return ans;
}
int main(){
	scanf("%d%d",&n,&m);for(int i=1;i<=n;++i){
		scanf("%s",t+1);
		for(int j=1;j<=m;++j)a[i]=(a[i]*233ll+t[j])%q,b[j]=(b[j]*233ll+t[j])%q;
	}
	printf("%lld\n",sol(a,n)*sol(b,m));
}