#include "bits/stdc++.h"
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;
 
#define REP(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)(a); i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007
#define _SPLIT " "
 
template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T,class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << setprecision(12) << a << endl;}
template<class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << _SPLIT; write(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

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

struct Info{
    int x,y;
};

int main(void)
{
    int h,w;
    bool vis[50][50]={0};
    string fd[50];
    read(h,w);
    rep(i,h)read(fd[i]);
    vector<pair<int,int>> v;
    rep(i,h){
        rep(j,w){
            if(vis[i][j]||fd[i][j]=='.')continue;
            vis[i][j]=true;
            queue<Info> q;
            q.push({(int)j,(int)i});
            pair<int,int> ct(0,0);
            while(!q.empty()){
                auto tp=q.front();
                q.pop();
                if(fd[tp.y][tp.x]=='w')ct.first++;
                else ct.second++;
                rep(i,4){
                    int xx=tp.x+dx[i];
                    int yy=tp.y+dy[i];
                    if(xx<0||xx>=w||yy<0||yy>=h)continue;
                    if(vis[yy][xx]||fd[yy][xx]=='.')continue;
                    vis[yy][xx]=true;
                    q.push({xx,yy});
                }
            }
            v.push_back(ct);
        }
    }
    int res=0;
    int mw=0,mb=0;
    rep(i,v.size()){
        int cw=v[i].first;
        int cb=v[i].second;
        if(cw>cb){
            mw+=cw-cb;res+=cb*100;
        }
        else if(cw<cb){
            mb+=cb-cw;res+=cw*100;
        }
        else res+=cw*100;
    }
    if(mw>mb)swap(mw,mb);
    res+=mw*10;
    res+=mb-mw;
    write(res);
    return 0;
}