from itertools import permutations
import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def dfs(i=0,j=0,cnt=0):
        if i==h:
            p=min(wn,bn)-cnt
            return cnt*100+p*10+max(wn,bn)-cnt-p
        ni,nj=i,j+1
        if nj==w:ni,nj=i+1,0
        res=dfs(ni,nj,cnt)
        if j+1<w and aa[i][j] and aa[i][j+1]:
            aa[i][j + 1]=0
            res=max(res,dfs(ni,nj,cnt+1))
            aa[i][j + 1]=1
        if i+1<h and aa[i][j] and aa[i+1][j]:
            aa[i+1][j]=0
            res=max(res,dfs(ni,nj,cnt+1))
            aa[i+1][j]=1
        return res

    h,w=MI()
    aa=[]
    wn=bn=0
    for _ in range(h):
        s=SI()
        wn+=s.count("w")
        bn+=s.count("b")
        aa.append([0 if c=="." else 1 for c in s])
    #p2D(aa)
    print(dfs())

main()