#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

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

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll M[400][400];
bool visited[400][400];
ll H, W;
VS S;
ll color;

void bfs(ll i, ll j){ 
  if(visited[i][j]) return;
  // i, jから始める
  queue<pair<ll, ll>> que;

  que.push(make_pair(i, j));
  visited[i][j] = true;

    while(!que.empty()){
    auto pa = que.front(); que.pop();
    ll y = pa.first;
    ll x = pa.second;
    M[y][x]=color;
    rep(i, 4){
      ll ty = y + dy[i];
      ll tx = x + dx[i];
      if(0<=ty && ty<H && 0<=tx && tx<W && S[y][x]!=S[ty][tx] && !visited[ty][tx]){
        que.push(make_pair(ty, tx));
        visited[ty][tx]=true;
      }
    }
  }
  color++;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> H >> W;

    rep(i, H){
      string s; cin >> s;
      S.push_back(s);
    }

    rep(i, H){
      rep(j, W){
        bfs(i, j);
      }
    }

    // rep(i, H){
    //   rep(j, W){
    //     cout << M[i][j] << ' ';
    //   }
    //   cout << endl;
    // }

    vector<vector<pair<ll, ll>>> A(color);
    rep(i, H){
      rep(j, W){
        ll c = M[i][j];
        A[c].push_back(make_pair(i, j));
      }
    }

    ll sum = 0;
    rep(c, color){
      ll black = 0;
      ll white = 0;
      for(auto pa : A[c]){
        ll i = pa.first;
        ll j = pa.second;
        if(S[i][j]=='#'){
          black++;
        }else{
          white++;
        }
      }
      sum += black*white;
    }
    p(sum);


    
    return 0;
}

Measured memory_bytes: 9472