dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]

def solve(n, m, chocolate):
    ans = 0
    while True:

        min_num = 5
        min_pos = (None, None)
        for y in range(n):
            for x in range(m):
                now = chocolate[y][x]

                num = 0
                for i in range(len(dy)):
                    ny, nx = y + dy[i], x + dx[i]
                    if 0 <= ny < n and 0 <= nx < m:
                        if now != "." and chocolate[ny][nx] != "." and chocolate[ny][nx] != now:
                            num += 1

                if num != 0 and num < min_num:
                    min_num = num
                    min_pos = (y, x)

        if min_num == 5:
            break

        y, x = min_pos
        for i in range(len(dy)):
            ny, nx = y + dy[i], x + dx[i]
            if 0 <= ny < n and 0 <= nx < m:
                if chocolate[ny][nx] != ".":
                    chocolate[y][x] = "."
                    chocolate[ny][nx] = "."
                    ans += 100

    w, b = 0, 0
    for y in range(n):
        for x in range(m):
            now = chocolate[y][x]
            w += now == "w"
            b += now == "b"

    ans += min(w, b) * 10
    ans += max(w, b) - min(w, b)
    return ans


def main():
    n, m = map(int, input().split())
    chocolate = []
    for _ in range(n):
        chocolate.append(list(input()))

    print(solve(n, m, chocolate))



if __name__ == '__main__':
    main()