#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int N, M;
vector<string> G;

int rec() {

  int ret = 0;
  bool ok = 0;

  rep(i, N) rep(j, M - 1) {
    if(G[i][j] == 'w' && G[i][j + 1] == 'b') {
      G[i][j] = G[i][j+1] = '.';
      ret = max(ret, rec() + 100);
      G[i][j] = 'w', G[i][j+1] = 'b';
      ok = 1;
    }
    else if(G[i][j] == 'b' && G[i][j + 1] == 'w') {
      G[i][j] = G[i][j+1] = '.';
      ret = max(ret, rec() + 100);
      G[i][j] = 'b', G[i][j+1] = 'w';
      ok = 1;
    }
  }

  rep(i, N - 1) rep(j, M) {
    if(G[i][j] == 'w' && G[i + 1][j] == 'b') {
      G[i][j] = G[i + 1][j] = '.';
      ret = max(ret, rec() + 100);
      G[i][j] = 'w', G[i + 1][j] = 'b';
      ok = 1;
    }
    else if(G[i][j] == 'b' && G[i + 1][j] == 'w') {
      G[i][j] = G[i + 1][j] = '.';
      ret = max(ret, rec() + 100);
      G[i][j] = 'b', G[i + 1][j] = 'w';
      ok = 1;
    }
  }

  if(!ok) {
    int b = 0, w = 0;

    rep(i, N) rep(j, M) {
      b += G[i][j] == 'b';
      w += G[i][j] == 'w';
    }

    ret += min(b, w) * 10;
    ret += b + w - 2 * min(b, w);
  }
  return ret;
}

int main() {

  cin >> N >> M;
  G.resize(N);
  rep(i, N) cin >> G[i];

  cout << rec() << endl;

  return 0;
}