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
from collections import deque
h,w=map(int,input().split())
p=['-'*(w+2)]
for i in range(h):
    p.append('-'+input()+'-')
p.append('-'*(w+2))

isl=[]
v=[[0 for i in range(w+2)] for j in range(h+2)]
d=[[0,1],[1,0],[-1,0],[0,-1]]

def bfs(x,y):
    if v[x][y]!=0:
        return
    q=deque()
    q.append((x,y))
    v[x][y]=1
    br,wh=0,0
    cnt=0
    while len(q)>0:
        ch,cw=q.popleft()
        #v[ch][cw]=1
        if p[ch][cw]=='#':
            br+=1
            for dh,dw in d:
                if p[ch+dh][cw+dw]=='.' and v[ch+dh][cw+dw]==0:
                    q.append((ch+dh,cw+dw))
                    v[ch+dh][cw+dw]=1
        elif p[ch][cw]=='.':
            wh+=1
            for dh,dw in d:
                if p[ch+dh][cw+dw]=='#' and v[ch+dh][cw+dw]==0:
                    q.append((ch+dh,cw+dw))
                    v[ch+dh][cw+dw]=1
        #print('xy=',x,y,'chw=',ch,cw,'bw=',br,wh,q)
    isl.append((br,wh))

for i in range(1,h+1):
    for j in range(1,w+1):
        bfs(i,j)

ans=0
for br,wh in isl:
    ans+=br*wh

print(ans)