#include<bits/stdc++.h>
using namespace std;
int row,col;
bool f[444][444];
int vis[444][444];
int B[444*444],W[444*444],T;
void dfs(int x,int y,bool c){
	if(x < 0 || x >= row || y < 0 || y >= col)return;
	if(f[x][y] != c || vis[x][y] != -1)return;
	vis[x][y] = T;
	bool cc = c;
	if((x+y)%2)cc = !cc;
	if(!cc)W[T] ++;
	dfs(x-1, y, c);
	dfs(x+1, y, c);
	dfs(x, y-1, c);
	dfs(x, y+1, c);
}
int main(){
	char s[999];
	scanf("%d%d",&row,&col);
	for(int i=0; i<row; i++){
		scanf("%s",s);
		for(int j=0; j<col; j++)
			f[i][j] = (s[j] == '#');
	}
	for(int i=0; i<row; i++)for(int j=0; j<col; j++)
		if((i+j)%2)f[i][j] = !f[i][j];
	memset(vis,-1,sizeof(vis));
	for(int i=0; i<row; i++)for(int j=0; j<col; j++){
		if(vis[i][j] == -1){
			dfs(i,j,f[i][j]);
			T++;
		}
	}
	long long int res = 0;
	for(int i=0; i<row; i++)for(int j=0; j<col; j++)
		if((i+j)%2)f[i][j] = !f[i][j];
	for(int i=0; i<row; i++)for(int j=0; j<col; j++)if(f[i][j])
		res += W[vis[i][j]];
	cout << res << endl;
	return 0;
}
