#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,int>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
void solve(){
int n,m;
cin >> n >> m;
int arr[n+5][m+5];
for(int x=1;x<=n;x++){
for(int y=1;y<=m;y++) cin >> arr[x][y];
}
//cout << "\n";
int dp[n+5][m+5];
memset(dp,0,sizeof(dp));
int counter=0;
for(int x=1;x<=n;x++){
for(int y=1;y<=m;y++){
bool amos=false;
if(arr[x-1][y]==arr[x][y]){
dp[x][y]+=dp[x-1][y];
amos=true;
}
if(arr[x][y-1]==arr[x][y]){
dp[x][y]+=dp[x][y-1];
amos=true;
}
if(amos&&arr[x-1][y-1]==arr[x][y]) dp[x][y]-=dp[x-1][y-1];
dp[x][y]++;
counter+=dp[x][y];
//cout << dp[x][y] << " ";
}
//cout << "\n";
}
cout << counter;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("in.txt","r",stdin);
//freopen("in.txt","w",stdout);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
