#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

string field[55];
bool done[55][55];

int calc(int w, int b) {
    if (w > b) swap(w, b);
    return w*10 + b-w;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < N; i++) {
        cin >> field[i];
    }
    int ans = 0;
    int W = 0, B = 0;
    for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) {
        if (!done[i][j] && field[i][j] != '.') {
            int w = 0, b = 0;
            queue<pii> que;
            que.push(pii(i, j));
            done[i][j] = true;
            while (!que.empty()) {
                pii now = que.front(); que.pop();
                int y = now.first, x = now.second;
                if (field[y][x] == 'w') w++;
                else b++;
                for (int k = 0; k < 4; k++) {
                    int ny = y+dy[k], nx = x+dx[k];
                    if (ny < 0 || ny >= N || nx < 0 || nx >= M) continue;
                    if (done[ny][nx]) continue;
                    if (field[ny][nx] != '.') {
                        done[ny][nx] = true;
                        que.push(pii(ny, nx));
                    }
                }
            }
            ans += min(b, w)*100;
            B += max(b-w, 0);
            W += max(w-b, 0);
        }
    }
    ans += calc(W, B);
    cout << ans << endl;
    return 0;
}