/*
                                                                                
                                   ### #                                        
                              ############# #                                   
                          #######################                               
                     ################################                           
                 #########################################                      
              ##############################################                    
             #     #####################################     #                  
            ######     ############################     ######                  
            ###########     ###################   # ##########                  
            ################    #########      ###############                  
            ####################        # ####################                  
            #######   ##############  ########################                  
            ########       #########  ########################                  
            ###########      #######  ########################                  
            ############## # #######  ########################                  
            ########################  ########################                  
            ########################  ########################                  
            ########################  ########################                  
              ######################  #######################                   
                 ###################  ###################                       
                      ##############  ###############                           
                          ##########  ##########                                
                              ######  ######                                    
                                  ##  ##                                        
                                                                                
                                                                                
                                                                                
                        #                             #                         
                        #      #                      #                         
        #    #  #    #  #   #      ####   ####     ####   ####   ####           
         #   #  #    #  # ##   #  #      #    #  #    #  #____#  ##             
          # #/  #    #  ## #   #  #      #    #  #    #  #^^^^   #              
           ##    ###/#  #   #  #   ####   ####    ###/#   ####   #              
           #                                                                    
         ##                                                                     
                                                                                
*/

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{
    long long start_, end_, step_;
   public:
    struct range_iterator{
      long long val, step_;
      range_iterator(long long v, long long step) : val(v), step_(step) {}
      long long operator * (){return val;}
      void operator ++ (){val += step_;}
      bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
    };
    range(long long len) : start_(0), end_(len), step_(1) {}
    range(long long start, long long end) : start_(start), end_(end), step_(1) {}
    range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
    range_iterator begin(){ return range_iterator(start_, step_); }
    range_iterator   end(){ return range_iterator(  end_, step_); }
  };

  string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){
    stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
  }

  string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }

}

constexpr long long mod = 9_ten + 7;

struct edge{
  int to;
  int cap;
  int rev;
};

int Ford_Fulkerson_dfs(vector<vector<edge> > &G, int pos, int flow, vector<bool> &used, int t){
  if(pos == t){
    return flow;
  }else{
    used[pos] = true;
    for(int i=0; i<G[pos].size(); i++){
      if(!used[G[pos][i].to] && G[pos][i].cap >0){
        int myflow = Ford_Fulkerson_dfs(G, G[pos][i].to, min(flow, G[pos][i].cap), used, t);
        if(myflow > 0){
          G[pos][i].cap -= myflow;
          G[ G[pos][i].to ][ G[pos][i].rev ].cap += myflow;
          return myflow;
        }
      }
    }
    return 0;
  }
}

int Ford_Fulkerson(vector<vector<edge> > &G, int s, int t){
  const int INF = 100000000;
  int flow=0;
  for(;;){
    vector<bool> used(G.size(), false);
    int f = Ford_Fulkerson_dfs(G, s, INF, used, t);
    if(f==0) break;
    else flow += f;
  }
  return flow;
}

void add_edge(vector<vector<edge> > &G, int from, int to, int cap){
  G[from].push_back( (edge){to, cap, (int)G[to].size()} );
  G[to].push_back( (edge){from, 0, (int)G[from].size()-1} );
}

int dx[] = {0, 0, 1,-1, 1, 1,-1,-1};
int dy[] = {1,-1, 0, 0, 1,-1, 1,-1};

int main(){
  int h,w;
  cin >> h,w;
  vector<string> s(h);
  cin >> s;

  vector<vector<edge>> G(h*w + 2);
  int source = h*w;
  int sink = h*w + 1;

  int cnt_b = 0, cnt_w = 0;
  for(auto y : range(h) ){
    for(auto x : range(w) ){
      if(s[y][x] == '.') continue;
      if(s[y][x] == 'b'){
        cnt_b++;
        add_edge(G, y*w + x, sink, 1);
      }else{
        cnt_w++;
        add_edge(G, source, y*w + x, 1);
        for(int k__=0; k__<4; k__++){
          int new_x = x + dx[k__];
          int new_y = y + dy[k__];
          if(new_x < 0 || new_x >= w || new_y < 0 || new_y >= h) continue;
          if(s[new_y][new_x] == '.') continue;
          add_edge(G, y*w + x, new_y*w + new_x, 1);
        }
      }
    }
  }

  int f = Ford_Fulkerson(G, source, sink);
  int ans = f*100;
  cnt_b -= f;
  cnt_w -= f;
  ans += min(cnt_b, cnt_w) * 10;
  ans += max(cnt_b, cnt_w) - min(cnt_b, cnt_w);

  println(ans);
  return 0;
}