#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>

using namespace std;
typedef pair<int, int> P;
typedef long long int ll;

const int INF = 1<<30;

char field[410][410];
int h, w;
int dx[]={0, 0, 1, -1}, dy[]={1, -1, 0, 0};
P voyage(int i, int j){
  int sharp=0, dot=0;
  char c=(field[i][j]=='#'?'.':'#');
  if(field[i][j]=='#')sharp++;
  else dot++;
  field[i][j]='x';
  for(int k=0;k<4;k++){
    int x=i+dx[k], y=j+dy[k];
    if(0<=x&&x<h&&0<=y&&y<w&&field[x][y]==c){
      P p = voyage(x, y);
      sharp+=p.first;dot+=p.second;
    }
  }
  return P(sharp, dot);
}

int main(){
  cin>>h>>w;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      cin>>field[i][j];
    }
  }
  ll ans=0;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      if(field[i][j]=='#'){
        P p = voyage(i, j);
        ans+=ll(p.first)*ll(p.second);
      }
    }
  }
  cout<<ans<<endl;
}
