#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N,M;
string bd[60];
bool used[60][60];
int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};

int mycount(int i, int j){
  char c = 'w';
  if (bd[i][j] == 'w') {
    c = 'b';
  }
  int cnt = 0;
  rep(k,4){
    int ni = i + dx[k];
    int nj = j + dy[k];
    if (0 <= ni && ni < N && 0 <= nj && nj < M) {
      if (bd[ni][nj] == c) {
        cnt += 1;
      }
    }
  }
  //DEBUG3(i,j,cnt);
  return cnt;
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> M;
  rep(i,N){
    cin >> bd[i];
  }
  ll ans = 0;
  using T = pair <int, pair <int,int> >;
  priority_queue <T, vector <T>, greater <T> > que;
  rep(i,N){
    rep(j,M){
      if (bd[i][j] == '.') {
        continue;
      }
      que.push(mp(mycount(i,j), mp(i,j)));
    }
  }

  while(!que.empty()){
    auto t = que.top();

    que.pop();
    int i = t.sec.fir;
    int j = t.sec.sec;
    if (used[i][j]) {
      continue;
    }
    //DEBUG1(t);
    used[i][j] = true;
    if (t.fir == 0 || bd[i][j] == '.') {
      continue;
    }
    char c = 'w';
    if (bd[i][j] == 'w') {
      c = 'b';
    }
    rep(k,4){
      int ni = i + dx[k];
      int nj = j + dy[k];
      if (0 <= ni && ni < N && 0 <= nj && nj < M) {
        if (bd[ni][nj] == c) {
          //DEBUG4(i,j,ni,nj);
          bd[i][j] = '.';
          bd[ni][nj] = '.';
          rep(k2, 4){
            int nni = ni + dx[k2];
            int nnj = nj + dy[k2];
            if (0 <= nni && nni < N && 0 <= nnj && nnj < M && bd[nni][nnj] != '.') {
              int nnc = mycount(nni,nnj);
              que.push(mp(nnc, mp(nni,nnj)));
            }
          }
          rep(k2, 4){
            int nni = i + dx[k2];
            int nnj = j + dy[k2];
            if (0 <= nni && nni < N && 0 <= nnj && nnj < M  && bd[nni][nnj] != '.') {
              int nnc = mycount(nni,nnj);
              que.push(mp(nnc, mp(nni,nnj)));
            }
          }

          ans += 100;
          break;
        }
      }
    }
  }


  map <char, int> bw;
  rep(i,N){
    rep(j,M){
      bw[bd[i][j]] += 1;
    }
  }
  int b = max(bw['b'], bw['w']);
  int w = min(bw['b'], bw['w']);
  cout << ans + w * 10 + (b - w) << endl;
  return 0;
}