#include<bits/stdc++.h>
using namespace std;

#define int long long

const int N=2e3+1e2+7;

int n,m;

string s[N];

void trans(vector<vector<int> >&a,int &n,int &m)
{
    vector<vector<int> >b(m+2,vector<int>(n+2));
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
            b[i][j]=a[j][i];
    swap(n,m);
    a.swap(b);
}

int ans;

int u[N][N],l[N][N],d[N][N],r[N][N];

int cl[N][N],cr[N][N];

void solve(vector<vector<int> >&a,int n,int m)
{
    if(n>m)
        trans(a,n,m);
    if(n==1)
        return;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            l[i][j]=a[i][j]==a[i][j-1]?l[i][j-1]+1:1,u[i][j]=a[i][j]==a[i-1][j]?u[i-1][j]+1:1;
    for(int i=n;i>=1;i--)
        for(int j=m;j>=1;j--)
            d[i][j]=a[i][j]==a[i+1][j]?d[i+1][j]+1:1,r[i][j]=a[i][j]==a[i][j+1]?r[i][j+1]+1:1;
    int mid=(m+1)>>1;
    for(int i=1;i<=n;i++)
    {
        {
            vector<int> s(n+1);
            for(int k=mid-l[i][mid]+1;k<=mid;k++)
                s[u[i][k]]++;
            for(int i=n-1;i>=1;i--)
                s[i]+=s[i+1];
            for(int j=1;j<i;j++)
            {
                if(l[j][mid]>l[i][mid])
                    cl[j][i]+=s[i-j];
            }
        }
        {
            vector<int> s(n+1);
            for(int k=mid-l[i][mid]+1;k<=mid;k++)
                s[d[i][k]]++;
            for(int i=n-1;i>=1;i--)
                s[i]+=s[i+1];
            for(int j=i+1;j<=n;j++)
            {
                if(l[j][mid]>=l[i][mid])
                    cl[i][j]+=s[j-i];
            }
        }
    }

    
    for(int i=1;i<=n;i++)
    {
        {
            vector<int> s(n+1);
            for(int k=mid+1;k<=r[i][mid+1]+mid;k++)
                s[u[i][k]]++;
            for(int i=n-1;i>=1;i--)
                s[i]+=s[i+1];
            for(int j=1;j<i;j++)
            {
                if(r[j][mid+1]>r[i][mid+1])
                    cr[j][i]+=s[i-j];
            }
        }
        {
            vector<int> s(n+1);
            for(int k=mid+1;k<=r[i][mid+1]+mid;k++)
                s[d[i][k]]++;
            for(int i=n-1;i>=1;i--)
                s[i]+=s[i+1];
            for(int j=i+1;j<=n;j++)
            {
                if(r[j][mid+1]>=r[i][mid+1])
                    cr[i][j]+=s[j-i];
            }
        }
    }

    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
        {
            if(a[i][mid]==a[i][mid+1]&&a[i][mid]==a[j][mid]&&a[i][mid+1]==a[j][mid+1])
                ans+=cl[i][j]*cr[i][j];
            cl[i][j]=cr[i][j]=0;
        }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            u[i][j]=l[i][j]=r[i][j]=d[i][j]=0;
    vector<vector<int> >al(n+2,vector<int>(mid+2));
    for(int i=1;i<=n;i++)
        for(int j=1;j<=mid;j++)
            al[i][j]=a[i][j];
    solve(al,n,mid);
    vector<vector<int> >ar(n+2,vector<int>((m-mid)+2));
    
    for(int i=1;i<=n;i++)
        for(int j=mid+1;j<=m;j++)
            ar[i][j-mid]=a[i][j];
    solve(ar,n,m-mid);
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>s[i],s[i]=' '+s[i];
    vector<vector<int> >a(n+2,vector<int>(m+2));
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            a[i][j]=(s[i][j]);
    solve(a,n,m);
    cout<<ans<<"\n";
}