from collections import defaultdict

class Unionfind:
    def __init__(self, N):
        self.par = [-1] * N
        self.rank = [1] * N
        
    def root(self, x):
        if self.par[x] < 0:
            return x
        
        self.par[x] = self.root(self.par[x])
        return self.par[x]
    
    def unite(self, x, y):
        rx, ry = self.root(x), self.root(y)
        
        if rx != ry:
            if self.rank[rx] >= self.rank[ry]:
                self.par[rx] += self.par[ry]
                self.par[ry] = rx
                
                if self.rank[rx] == self.rank[ry]:
                    self.rank[rx] += 1
            else:
                self.par[ry] += self.par[rx]
                self.par[rx] = ry
    
    def is_same(self, x, y):
        return self.root(x) == self.root(y)
    
    def count(self, x):
        return -self.par[self.root(x)]
        
N, M = map(int, input().split())
S = [input() for _ in range(N)]
uf = Unionfind(N*M)

for i in range(N):
    for j in range(M):
            for ni, nj in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:
                if 0<=ni<N and 0<=nj<M and S[ni][nj] != '.':
                    uf.unite(M*i+j, M*ni+nj)

group = defaultdict(dict)

for i in range(N):
    for j in range(M):
        if S[i][j] == 'w':
            if 0 not in group[uf.root(M*i+j)]:
                group[uf.root(M*i+j)][0] = 1
            else:
                group[uf.root(M*i+j)][0] += 1
        elif S[i][j] == 'b':
            if 1 not in group[uf.root(M*i+j)]:
                group[uf.root(M*i+j)][1]= 1
            else:
                group[uf.root(M*i+j)][1] += 1

pair_sum = 0
w_amari = 0
b_amari = 0

for k in group:
    pair = min(group[k][0], group[k][1])
    pair_sum += pair
    w_amari += group[k][0]-pair
    b_amari += group[k][1]-pair

print(pair_sum*100+min(w_amari, b_amari)*10+abs(w_amari-b_amari))