#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std; bool MEM;
using ll=long long; using ld=long double;
using lll=__int128;
using pii=pair<int,int>; using pll=pair<ll,ll>;
const int I=1e9;
const ll J=1e18,N=1e6+7,K=21,B[2]={131,137},BB[2]={998244353,1000000007},P=1004535809;
ll h,w,ansh,answ; vector<char> str[N]; char s[N];
ll n,pw[N][2],lim[N],pl[N],pr[N]; pll a[N],sf[N],sb[N];
pll st[N]; ll tp;
pll cf(ll l,ll r) { return {(sf[r].fi+P-sf[l-1].fi*pw[r-l+1][0]%P)%P,(sf[r].se+P-sf[l-1].se*pw[r-l+1][1]%P)%P}; };
pll cb(ll l,ll r) { return {(sb[l].fi+P-sb[r+1].fi*pw[r-l+1][0]%P)%P,(sb[l].se+P-sb[r+1].se*pw[r-l+1][1]%P)%P}; };
struct bit {
	ll c[N*2];
	void clr() { for (ll i=1;i<=n*2;i++) c[i]=0; }
	void add(ll x,ll y) { for (;x<=n*2;x+=x&-x) c[x]=max(c[x],y); }
	ll que(ll x) { ll ret=0; for (;x;x-=x&-x) ret=max(ret,c[x]); return ret; }
} T;
struct tib {
	ll c[N];
	void clr() { for (ll i=1;i<=n;i++) c[i]=0; }
	void add(ll x,ll y) { for (;x;x-=x&-x) c[x]+=y; }
	ll que(ll x) { ll ret=0; for (;x<=n;x+=x&-x) ret+=c[x]; return ret; }
} TT;
void slove(ll *pp) {
	for (ll i=1;i<=n;i++) sf[i]={(sf[i-1].fi*BB[0]+a[i].fi)%P,(sf[i-1].se*BB[1]+a[i].se)%P};
	sb[n+1]={0,0};
	for (ll i=n;i;i--) sb[i]={(sb[i+1].fi*BB[0]+a[i].fi)%P,(sb[i+1].se*BB[1]+a[i].se)%P};
	pp[1]=1;
	for (ll i=2,lst=1;i<=n;i++) {
		if (cf(lst,i-1)==cb(i,i*2-lst-1)) pp[i]=i*2-lst-1,lst=i;
		else pp[i]=n+1;
	}
}
void solve() {
	// for (ll i=1;i<=n;i++) printf("%lld ",a[i].fi); printf("\n");
	slove(pl),reverse(a+1,a+n+1);
	slove(pr),reverse(pr+1,pr+n+1);
	for (ll i=1;i<=n;i++) pr[i]=n-pr[i]+1;
	// for (ll i=1;i<=n;i++) printf(" %lld",pl[i]); printf("\n");
	// for (ll i=1;i<=n;i++) printf(" %lld",pr[i]); printf("\n");
	TT.clr();
	tp=0;
	for (ll i=1;i<=n;i++) if (pr[i]>=1) st[++tp]={pr[i],i};
	sort(st+1,st+tp+1);
	for (ll i=n,j=tp;i;i--) {
		while (j&&st[j].fi>=i) TT.add(st[j].se,1),j--;
		if (pl[i]<=n) answ+=TT.que(pl[i]);
	}
}
void mian() {
	// h=1,w=1e6;
	scanf("%lld%lld",&h,&w);
	for (ll i=1;i<=h;i++) {
		// for (ll j=1;j<=w;j++) s[j]='a';
		scanf("%s",s+1);
		str[i].resize(w+1);
		for (ll j=1;j<=w;j++) str[i][j]=s[j];
	}
	for (ll i=1;i<=h;i++) {
		pll hh={0,0};
		for (ll j=1;j<=w;j++) hh={(hh.fi*B[0]+str[i][j])%BB[0],(hh.se*B[1]+str[i][j])%BB[0]};
		a[i]=hh;
	}
	n=h,solve(),ansh=answ,answ=0;
	for (ll i=1;i<=w;i++) {
		pll hh={0,0};
		for (ll j=1;j<=h;j++) hh={(hh.fi*B[0]+str[j][i])%BB[0],(hh.se*B[1]+str[j][i])%BB[0]};
		a[i]=hh;
	}
	n=w,solve();
	cerr<<ansh<<" "<<answ<<"\n";
	cout<<ansh*answ<<"\n";
}
bool ORY; int main() {
	for (ll o=0;o<2;o++) {
		pw[0][o]=1;
		for (ll i=1;i<N;i++) pw[i][o]=pw[i-1][o]*BB[o]%P;
	}
//	while (1)
//	int t; for (scanf("%d",&t);t--;)
	mian();
	cerr<<"\n"<<abs(&MEM-&ORY)/1048576<<"MB";
	return 0;
}