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
def bfs(sl, visited, sy, sx, h, w):
    q = deque([(sy,sx,sl[sy][sx])])
    visited[sy][sx] = 0
    bh_cnt = {'#':0, '.':0}
    bh_cnt[sl[sy][sx]] += 1
    while q:
        y, x, bh = q.popleft()
        for j, k in ([1, 0], [-1, 0], [0, 1], [0, -1]):
            ny, nx = y+j, x+k
            if ny >= h or nx >= w or ny < 0 or nx < 0:
                continue
            if sl[ny][nx] != bh and visited[ny][nx] == -1:
                visited[ny][nx] = visited[y][x] + 1
                bh_cnt[sl[ny][nx]] += 1
                q.append((ny,nx,sl[ny][nx]))
    return bh_cnt['#']*bh_cnt['.']


h,w = map(int, input().split())
sl = []
for _ in range(h):
    row = list(input())
    sl.append(row)
visited = [ [-1]*w for i in range(h)]

ans = 0
for hi in range(h):
    for wi in range(w):
        if visited[hi][wi] != -1: continue
        ans += bfs(sl, visited, hi, wi, h, w)
print(ans)