#include <bits/stdc++.h>

using namespace std;

const int dirx[] = {1, -1, 0, 0};
const int diry[] = {0, 0, 1, -1};

int black, white, h, w;
bool vis[405][405];
char s[405][405];


void dfs(int x, int y) {
    vis[x][y] = 1;

    if (s[x][y] == '#') black++;
    else white++;

    for (int i = 0; i < 4; i++) {
        int newx = x + dirx[i];
        int newy = y + diry[i];
        if (newx < 0 || newx >= h || newy < 0 || newy >= w) continue;
        if (s[x][y] == s[newx][newy]) continue;
        if (vis[newx][newy]) continue;
        dfs(newx, newy);
    }
}

int main() {
    scanf("%d%d", &h, &w);

    for (int i = 0; i < h; i++) scanf("%s", s[i]);

    long long res = 0;

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (vis[i][j]) continue;
            black = 0;
            white = 0;
            dfs(i, j);
            res += 1LL * black * white;
        }
    }

    printf("%lld\n", res);
}
