#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
        #define eprintf(...) 42
#endif

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
*/

int n, m;
string s[50];

pii dfs(int y, int x)
{
  pii res = mp(0, 0);
  if(s[y][x] == 'w'){
    res.first++;
  }else if(s[y][x] == 'b'){
    res.second++;
  }

  s[y][x] = '.';

  int dx[] = {1, -1, 0, 0};
  int dy[] = {0, 0, 1, -1};
  rep(i, 4){
    int nx = x + dx[i];
    int ny = y + dy[i];

    if(nx < 0 or m <= nx or ny < 0 or n <= ny) continue;

    if(s[ny][nx] != '.'){
      pii p = dfs(ny, nx); 
      res.first += p.first;
      res.second += p.second;
    }
  }

  return res;
}

int main()
{
  cin >> n >> m;
  rep(i, n) cin >> s[i];

  int ans = 0;
  pii cnt;
  rep(i, n){
    rep(j, m){
      if(s[i][j] != '.'){
        pii p = dfs(i, j);
        int mi = min(p.first, p.second);
        ans += 100*mi;
        cnt.first += p.first - mi;
        cnt.second += p.second - mi;
      }
    }
  }

  int mi = min(cnt.first, cnt.second);
  ans += 10*mi;
  ans += cnt.first-mi + cnt.second-mi;

  cout << ans << endl;
  
  return 0;
}