#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=1000100;

const int INF=(1<<29);

int n,m;

char s[1100][1100];

int down[1100][1100];

void init_down(){

    for(int j=1;j<=m;j++){

        int l=1,r=1;

        for(;l<=n;){

            while(r+1<=n && s[r+1][j]==s[l][j]) r++;

            for(int i=l;i<=r;i++) down[i][j]=r-i+1;

            l=r+1;r=l;

        }

    }

}

bool check(int i,int j,int cnt,int k){

    if(s[i][j]!=s[i][k] || s[i+cnt][j]!=s[i+cnt][k] || s[i+2*cnt][j]!=s[i+2*cnt][k]) return 0;

    return down[i][k]==cnt && down[i+cnt][k]==cnt && down[i+2*cnt][k]>=cnt;

}

void solve(){

    for(int i=1;i<=n;i++) scanf("%s",s[i]+1);

    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) down[i][j]=0;

    init_down();

    ll res=0;

    for(int i=1;i<=n;i++){

        for(int j=1;j<=m;){

            int cnt=down[i][j];

            if(i+3*cnt-1>n||!check(i,j,cnt,j)){

                j++;continue;

            }

            int k=j;

            while(k+1<=m&&check(i,j,cnt,k+1)) k++;

            int w=k-j+1;

            res+=1LL*w*(w+1)/2;

            j=k+1;

        }

    }

    cout<<res<<endl;

}

int main(){

    // freopen("in.txt","r",stdin);

    while(cin>>n>>m) solve();

    return 0;

}