def main():

    from collections import defaultdict

    import sys

    sys.setrecursionlimit(10 ** 9)

    

    H, W = list(map(int, input().split()))

    G = [list(eval(input())) for i in range(H)]

    

    Visited = [[0] * W for i in range(H)]

    direction = [[0, 1], [0, -1], [1, 0], [-1, 0]]

    

    

    def dfs(ny, nx, color):

        for dy, dx in direction:

            if not ((0 <= ny + dy < H) and (0 <= nx + dx < W)):

                continue

    

            if G[ny + dy][nx + dx] == G[ny][nx]:

                continue

    

            if Visited[ny + dy][nx + dx] != 0:

                continue

    

            if G[ny + dy][nx + dx] == '#':

                Visited[ny + dy][nx + dx] = color

            else:

                Visited[ny + dy][nx + dx] = -color

    

            dfs(ny + dy, nx + dx, color)

    

    

    Color = 1

    for y in range(H):

        for x in range(W):

            if Visited[y][x] == 0:

                if G[y][x] == '#':

                    Visited[y][x] = Color

                else:

                    Visited[y][x] = -Color

                dfs(y, x, Color)

                Color += 1

    

    D = defaultdict(int)

    for i in range(1, Color + 1):

        D[i] = 0

        D[-i] = 0

    

    for row in Visited:

        for data in row:

            D[data] += 1

    

    ans = 0

    for key in list(D.keys()):

        ans += D[key] * D[-key]

    

    print((ans // 2))

    

main()

def main():

    from collections import defaultdict

    import sys

    sys.setrecursionlimit(10 ** 9)

    

    H, W = list(map(int, input().split()))

    G = [list(input()) for i in range(H)]

    

    Visited = [[0] * W for i in range(H)]

    direction = [[0, 1], [0, -1], [1, 0], [-1, 0]]

    

    

    def dfs(ny, nx, color):

        for dy, dx in direction:

            if not ((0 <= ny + dy < H) and (0 <= nx + dx < W)):

                continue

    

            if G[ny + dy][nx + dx] == G[ny][nx]:

                continue

    

            if Visited[ny + dy][nx + dx] != 0:

                continue

    

            if G[ny + dy][nx + dx] == '#':

                Visited[ny + dy][nx + dx] = color

            else:

                Visited[ny + dy][nx + dx] = -color

    

            dfs(ny + dy, nx + dx, color)

    

    

    Color = 1

    for y in range(H):

        for x in range(W):

            if Visited[y][x] == 0:

                if G[y][x] == '#':

                    Visited[y][x] = Color

                else:

                    Visited[y][x] = -Color

                dfs(y, x, Color)

                Color += 1

    

    D = defaultdict(int)

    for i in range(1, Color + 1):

        D[i] = 0

        D[-i] = 0

    

    for row in Visited:

        for data in row:

            D[data] += 1

    

    ans = 0

    for key in list(D.keys()):

        ans += D[key] * D[-key]

    

    print((ans // 2))

    

main()

def main():
    from collections import defaultdict
    import sys

    sys.setrecursionlimit(10**9)
    H, W = list(map(int, input().split()))
    G = [list(eval(input())) for i in range(H)]
    Visited = [[0] * W for i in range(H)]
    direction = [[0, 1], [0, -1], [1, 0], [-1, 0]]

    def dfs(ny, nx, color):
        for dy, dx in direction:
            if not ((0 <= ny + dy < H) and (0 <= nx + dx < W)):
                continue
            if G[ny + dy][nx + dx] == G[ny][nx]:
                continue
            if Visited[ny + dy][nx + dx] != 0:
                continue
            if G[ny + dy][nx + dx] == "#":
                Visited[ny + dy][nx + dx] = color
            else:
                Visited[ny + dy][nx + dx] = -color
            dfs(ny + dy, nx + dx, color)

    Color = 1
    for y in range(H):
        for x in range(W):
            if Visited[y][x] == 0:
                if G[y][x] == "#":
                    Visited[y][x] = Color
                else:
                    Visited[y][x] = -Color
                dfs(y, x, Color)
                Color += 1
    D = defaultdict(int)
    for i in range(1, Color + 1):
        D[i] = 0
        D[-i] = 0
    for row in Visited:
        for data in row:
            D[data] += 1
    ans = 0
    for key in list(D.keys()):
        ans += D[key] * D[-key]
    print((ans // 2))


main()

def main():
    from collections import defaultdict
    import sys

    sys.setrecursionlimit(10**9)
    H, W = list(map(int, input().split()))
    G = [list(input()) for i in range(H)]
    Visited = [[0] * W for i in range(H)]
    direction = [[0, 1], [0, -1], [1, 0], [-1, 0]]

    def dfs(ny, nx, color):
        for dy, dx in direction:
            if not ((0 <= ny + dy < H) and (0 <= nx + dx < W)):
                continue
            if G[ny + dy][nx + dx] == G[ny][nx]:
                continue
            if Visited[ny + dy][nx + dx] != 0:
                continue
            if G[ny + dy][nx + dx] == "#":
                Visited[ny + dy][nx + dx] = color
            else:
                Visited[ny + dy][nx + dx] = -color
            dfs(ny + dy, nx + dx, color)

    Color = 1
    for y in range(H):
        for x in range(W):
            if Visited[y][x] == 0:
                if G[y][x] == "#":
                    Visited[y][x] = Color
                else:
                    Visited[y][x] = -Color
                dfs(y, x, Color)
                Color += 1
    D = defaultdict(int)
    for i in range(1, Color + 1):
        D[i] = 0
        D[-i] = 0
    for row in Visited:
        for data in row:
            D[data] += 1
    ans = 0
    for key in list(D.keys()):
        ans += D[key] * D[-key]
    print((ans // 2))


main()

-    G = [list(eval(input())) for i in range(H)] +    G = [list(input()) for i in range(H)]