#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
char mp[405][405];
//bool vis[405][405];
int belong[405][405];
pair<int, int> S[160010];
int Scnt;
int h, w;
void dfs(int x, int y, int s)
{
	belong[x][y] = s;
	if (mp[x][y] == '#')
		++S[s].first;
	else
		++S[s].second;
	for (int i = 0; i < 4; ++i)
	{
		int nx = x + dx[i], ny = y + dy[i];
		if (nx > 0 && nx <= h && ny > 0 && ny <= w && mp[x][y] != mp[nx][ny] && belong[nx][ny] == 0)
		{
			dfs(nx, ny, s);
		}
	}
}
void input()
{
	cin >> h >> w;
	for (int i = 1; i <= h; ++i)
	{
		cin >> (mp[i] + 1);
	}
}

void solve()
{
	for (int i = 1; i <= h; ++i)
		for (int j = 1; j <= w; ++j)
			if (!belong[i][j])
				dfs(i, j, ++Scnt);
	long long ans = 0;
	for (int i = 1; i <= Scnt; ++i)
		ans += 1LL * S[i].first * S[i].second;
	cout << ans;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	input();
	solve();
	return 0;
}
