There is a grid with H rows and W columns, where each square is painted black or white.

You are given H strings S_1, S_2, ..., S_H, each of length W. If the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is `#`; if that square is painted white, the j-th character in the string S_i is `.`.

Find the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:

* There is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...

Constraints

* 1 \leq H, W \leq 400
* |S_i| = W (1 \leq i \leq H)
* For each i (1 \leq i \leq H), the string S_i consists of characters `#` and `.`.

Input

Input is given from Standard Input in the following format:


H W
S_1
S_2
:
S_H


Output

Print the answer.

Examples

Input

3 3
.#.
..#
#..


Output

10


Input

3 3
.#.
..#
..


Output

10


Input

2 4
....
....


Output

0


Input

4 3


...


Output

6
#include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;

int main(){
  int h,w; cin>>h>>w;
  vector<string> m(h);
  for(int i=0;i<h;i++){
    cin>>m[i];
  }long long ans=0;
  int my[4]={0,0,-1,1};
  int mx[4]={-1,1,0,0};
  vector<vector<bool>> flag(h,vector<bool>(w,false));
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      if(flag[i][j]) continue;
      queue<P> que;
      que.push(P(i,j));
      flag[i][j]=true;
      long long a=0,b=0;
      while(!que.empty()){
        P p=que.front(); que.pop();
        int y=p.first,x=p.second;
        char base=m[y][x];
        if(base=='#') b++;
        else a++;
        for(int k=0;k<4;k++){
          int ny=y+my[k],nx=x+mx[k];
          if(ny>=h ||ny<0 ||nx<0 ||nx>=w) continue;
          if(flag[ny][nx] || m[ny][nx]==base) continue;
          flag[ny][nx]=true;
          que.push(P(ny,nx));
        }
      }
      ans+=a*b;
    }
  }
  cout<<ans<<endl;
}