#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define lf long double
typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <pair <int,int> >vii;
typedef vector <vector <ll> > vv;
typedef vector <string> vs;
ll mod=1000000007;
int main()
{
    ll n,m;
    cin>>n>>m;
    vs s(n,"");
    for(ll i=0;i<n;i++)
        cin>>s[i];
//    vector <vector <ii> > a(n/3+1,vector <ii> ());
    map <pair <pair <ll,ll> ,ll > ,bool> ma;
    for(ll len=1;len<=n/3;len++)
    {
        for(ll i=0;i+3*len-1<n;i++)
        {
            for(ll j=0;j<m;j++)
            {
                char c1=s[i][j];
                bool pos=true;
                for(ll i1=i;i1<i+len;i1++)
                {
                    if(s[i1][j]!=c1)
                    {
                        pos=false;
                        break;
                    }
                }
                if(pos==false)
                    continue;
                char c2=s[i+len][j];
                if(c2==c1)
                    pos=false;
                for(ll i1=i+len;i1<i+2*len;i1++)
                {
                    if(s[i1][j]!=c2)
                    {
                        pos=false;
                        break;
                    }
                }
                if(pos==false)
                    continue;
                char c3=s[i+2*len][j];
                if(c3==c2)
                    pos=false;
                for(ll i1=i+2*len;i1<i+3*len;i1++)
                {
                    if(s[i1][j]!=c3)
                    {
                        pos=false;
                        break;
                    }
                }
                if(pos==false)
                    continue;
                if(pos==true)
                {
                    ma[mp(mp(i,j),len)]=true;
                }
            }
        }
    }
    ll ans=ma.size();
    for(ll len=1;len<=n/3;len++)
    {
    for(ll i=0;i<n;i++)
    {
        for(ll j=0;j<m;j++)
        {
            if(ma[mp(mp(i,j),len)])
            {
                ll num=1;
                char c1=s[i][j];
                char c2=s[i+len][j];
                char c3=s[i+2*len][j];
                ll j1=j+1;
                while(j1<m)
                {
                    if(ma[mp(mp(i,j1),len)])
                    {
                        if(c1==s[i][j1] && c2==s[i+len][j1] && s[i+2*(len)][j1]==c3)
                        {
                            num++;
                            j1++;
                        }
                        else
                            break;
                    }
                    else
                    {
                        break;
                    }
                }
                ans+=num*(num-1)/2;
                j=j1-1;
            }

        }
    }
    }
    cout<<ans<<endl;
}