#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

void dfs(vector<vector<ll>>& z,ll oya,vector<ll> &kyori,vector<bool> &seen,ll now) {
    kyori[now] = oya;
    seen[now] = true;
    for (int i = 0; i < z[now].size(); i++) {
        if (seen[z[now][i]] == false) {
            dfs(z, oya + 1, kyori, seen, z[now][i]);
        }
    }
    return;
}

int main() {
    ll h,w;
    cin >> h >> w;
    vector<string> z(h);
    UnionFind uni(h*w);
    UnionFind unis(h * w);
    UnionFind unid(h * w);
    for (int i = 0; i < h; i++) {
        cin >> z[i];
    }
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w-1; j++) {
            if (z[i][j] != z[i][j + 1])uni.merge(i * w + j, i * w + j + 1);
        }
    }
    for (int i = 0; i < h-1; i++) {
        for (int j = 0; j < w; j++) {
            if (z[i][j] != z[i+1][j])uni.merge((i+1) * w + j, i * w + j);
        }
    }
    for (int i = 0; i < h-1; i++) {
        for (int j = 0; j < w - 1; j++) {
            if (z[i][j] == z[i + 1][j + 1] && (z[i][j] != z[i + 1][j] || z[i][j + 1] != z[i][j])) {
                if (z[i][j] == '#')unis.merge(i * w + j, (i + 1) * w + j + 1);
                else unid.merge(i * w + j, (i + 1) * w + j + 1);
            }
            if (z[i][j+1] == z[i+1][j] && (z[i+1][j] != z[i + 1][j+1] || z[i+1][j] != z[i][j])) {
                if (z[i][j+1] == '#')unis.merge(i * w + j+1, (i + 1) * w + j);
                else unid.merge(i * w + j+1, (i + 1) * w + j);
            }
        }
    }
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w - 2; j++) {
            if (z[i][j] == z[i][j + 2] && z[i][j] != z[i][j+1]) {
                if (z[i][j] == '#')unis.merge(i * w + j, i * w + j + 2);
                else unid.merge(i * w + j, i * w + j + 2);
            }
        }
    }
    for (int i = 0; i < h-2; i++) {
        for (int j = 0; j < w; j++) {
            if (z[i][j] == z[i+2][j] && z[i][j] != z[i+1][j]) {
                if (z[i][j] == '#')unis.merge(i * w + j, (i+2) * w + j);
                else unid.merge(i * w + j, (i+2) * w + j);
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < h * w; i++) {
        ans += uni.size(i) - 1;
    }
    for (int i = 0; i < h * w; i++) {
        ans -= unis.size(i) - 1;
    }
    for (int i = 0; i < h * w; i++) {
        ans -= unid.size(i) - 1;
    }
    ans /= 2;
    cout << ans << endl;
}

Measured memory_bytes: 10844