from collections import deque

def max_flow(s,t):
  def bb(n,g,w):
    if n==g:
      return w
    v[n]=0
    while a[n]<len(flow[n]):
      to,fl,edge=flow[n][a[n]]
      if fl and dist[to]==dist[n]+1 and v[to]:
        f=bb(to,g,min(w,fl))
        if f:
          flow[n][a[n]][1]-=f
          flow[to][edge][1]+=f
          return f
      a[n]+=1
    return 0
  res=0;m=len(flow);INF=1<<60
  while 1:
    dist=[INF]*m;dist[s]=0;f=deque([s])
    while f:
      q=f.popleft()
      for to,fl,edge in flow[q]:
        if fl and dist[to]==INF:
          dist[to]=dist[q]+1
          f.append(to)
    if dist[t]==INF:
      break
    a=[0]*m
    while 1:
      v=[1]*m
      f=bb(s,t,INF)
      if f:
        res+=f
      else:
        break
    if not res:
      break
  return res

def aa(a,b,fl):
  q,w=len(flow[a]),len(flow[b])
  flow[a].append([b,fl,w])
  flow[b].append([a,0,q])

n,m=map(int,input().split())
flow=[[] for i in range(n*m+2)]
s=[list(input()) for i in range(n)]
ans=0
a,b=0,0
for i in range(n):
  for j in range(m):
    c=i*m+j+1
    if s[i][j]=="b":
      a+=1
      aa(0,c,1)
      for l in range(n):
        for k in range(m):
          
          if s[l][k]=="w" and abs(i-l)+abs(j-k)==1:
            aa(c,l*m+k+1,1)
    if s[i][j]=="w":
      b+=1
      aa(c,n*m+1,1)
ans=max_flow(0,n*m+1)
c=min(a,b)-ans
d=max(a,b)-ans-c
print(ans*100+c*10+d)