#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
void write(__int128 x){if(x>9)write(x/10);putchar(x%10+48);}
const int N=1e6+9;
struct Kazemaru{
	int c[N],n;
	inline void init(int x){f(i,0,x)c[i]=0;n=x;}
	inline int add(int x,int y){for(;x<=n;x+=-x&x)c[x]+=y;return 0;}
	inline int sum(int x,int y=0){for(;x;x-=-x&x)y+=c[x];return y;}
}T;
struct str{
	const static int k=37,m1=1e9-63,m2=1e9+21;
	vector<int>p1,p2,h1,h2;int n;
	#define pb push_back
	inline void cl(){n=0;p1=p2=h1=h2={1};}
	inline void add(string a){
		for(char c:a){
			p1.pb(p1[n]*k%m1);h1.pb((h1[n]*k+c-'a'+3)%m1);
			p2.pb(p2[n]*k%m2);h2.pb((h2[n]*k+c-'a'+7)%m2);
			++n;
		}
	}
	inline int ask(int l,int r){
		int x1=(h1[r]-h1[l-1]*p1[r-l+1]%m1+m1)%m1;
		int x2=(h2[r]-h2[l-1]*p2[r-l+1]%m2+m2)%m2;
		return x1*m2+x2;
	}
}A,B;
string a[N],b[N];
struct op{int x,y,p;};
vector<op>c,d;
inline void ask(vector<op>&a,int n,int m){
	int l=1,r=0,p;a={{1,1}};
	f(i,1,n)if((p=i+1+i-l)<=n){
		f(j,1,m){
			int k=(j-1)*n;
			if(B.ask(k+n-i+1,k+n-l+1)!=A.ask(k+i+1,k+p))goto ed;
		}
		a.push_back({l=i+1,r=max(r,p)});ed:;
	}
}
inline __int128 clc(string*a,int n,int m){
	A.cl();B.cl();
	f(i,1,m)A.add(a[i]),reverse(a[i].begin(),a[i].end()),B.add(a[i]);
	ask(c,n,m);swap(A,B);ask(d,n,m);
	for(op e:d)c.push_back({n-e.y+1,n-e.x+1,1});
	int w=0;T.init(n);
	sort(c.begin(),c.end(),[&](op a,op b){return a.x==b.x?a.p<b.p:a.x<b.x;});
	for(op e:c)w+=e.p?T.sum(e.y):T.add(e.y,1);
	return w;
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	f(i,1,n)cin>>a[i];
	f(i,1,n)f(j,1,m)b[j]+=a[i][j-1];
	write(clc(a,m,n)*clc(b,n,m));
	return 0;
}