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

typedef long long ll;

const int MAXN = 4e2 + 5;

const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};

int N, M;
char mat[MAXN][MAXN];
bool bio[MAXN][MAXN];

void load() {
	scanf("%d%d", &N, &M);
	for (int i = 0; i < N; i++)
		scanf("%s", mat[i]);
}

void dfs(int x, int y, int &b, int &w) {
	bio[x][y] = true;
	if (mat[x][y] == '#')
		b++;
	else
		w++; 
	for (int i = 0; i < 4; i++) {
		int nx = x + dx[i];
		int ny = y + dy[i];
		if (nx < 0 || ny < 0 || nx >= N || ny >= M)
			continue;
		if (!bio[nx][ny] && mat[nx][ny] != mat[x][y])
			dfs(nx, ny, b, w);
	}
}

ll solve() {
	ll sol = 0;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < M; j++)
			if (!bio[i][j]) {
				int black = 0, white = 0;
				dfs(i, j, black, white);
				sol += (ll)black * white;
			}
	return sol;
}

int main() {
	load();
	printf("%lld\n", solve());
	return 0;
}