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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

#ifdef DEBUG
#define debug(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(fmt, ...)
#endif

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


class UnionFind {
 public:
  vector<int> data;
  int count;
 public:
  UnionFind(int size) : data(size, -1), count(size) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
      --count;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};

#define HW(r,c) ((r)*W+(c))

ll solve(int H,int W, vs& s) {
    UnionFind uf(H*W);
    rep(r,H)rep(c,W) {
        if (0 < r) {
            if (s[r-1][c] != s[r][c]) uf.unionSet(HW(r-1,c), HW(r,c));
        }
        if (r+1 < H) {
            if (s[r+1][c] != s[r][c]) uf.unionSet(HW(r+1,c), HW(r,c));
        }
        if (0 < c) {
            if (s[r][c-1] != s[r][c]) uf.unionSet(HW(r,c-1), HW(r,c));
        }
        if (c+1 < W) {
            if (s[r][c+1] != s[r][c]) uf.unionSet(HW(r,c+1), HW(r,c));
        }
    }

    unordered_map<int,ll> bl, wh;
    unordered_set<int> roots;
    rep(r,H) rep(c,W) {
        int rt = uf.root(HW(r,c));
        roots.insert(rt);
        if (s[r][c] == '#') {
            bl[rt]++;
        } else {
            wh[rt]++;
        }
    }
    ll cnt = 0;
    for (int rt: roots){
        cnt += bl[rt] * wh[rt];
    }
    return cnt;
}

int main() {
    int H, W; cin >> H >> W;
    vs s(H);
    rep(i,H) cin >> s[i];
    cout << solve(H,W,s) << endl;
    return 0;
}


Measured memory_bytes: 20624