#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+05;
struct edge {
    int to, cost, id;
};

ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };

struct unionfind {
    vector<int> par, t_rank, siz, bl, wh;
    unionfind(int n) // n要素で初期化(1-indexed)
        : par(n + 1)
        , t_rank(n + 1)
        , siz(n + 1)
        , bl(n + 1, 0)
        , wh(n + 1, 0)
    {
        // n要素で初期化
        // 1-indexedになっているので0-indexedで使いたいときは注意
        for (int i = 0; i <= n; i++) {
            par[i] = i;
            siz[i] = 1;
            t_rank[i] = 0;
        }
    }

    // 木の根を求める
    int find(int x)
    {
        if (par[x] == x) {
            return x;
        } else {
            return par[x] = find(par[x]);
        }
    }

    // xとyの属する集合を併合
    void unite(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x == y)
            return;

        if (t_rank[x] < t_rank[y]) {
            par[x] = y;
            siz[y] += siz[x];
            bl[y] += bl[x];
            wh[y] += wh[x];
        } else {
            par[y] = x;
            siz[x] += siz[y];
            bl[x] += bl[y];
            wh[x] += wh[y];
            if (t_rank[x] == t_rank[y])
                t_rank[x]++;
        }
    }

    // xとyが同じ集合に属するか否か
    bool same(int x, int y)
    {
        return find(x) == find(y);
    }

    // xの属するグループのサイズを求める
    int size(int x)
    {
        return siz[find(x)];
    }

    int black(int x)
    {
        return bl[find(x)];
    }
    int white(int x)
    {
        return wh[find(x)];
    }
};

int N, M;
char S[50][50];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> M;

    unionfind uft(N * M);

    for (int i = 0; i < N; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < M; ++j) {
            S[i][j] = s[j];
            if (s[j] == 'b')
                uft.bl[i * M + j] = 1;
            else if (s[j] == 'w')
                uft.wh[i * M + j] = 1;
        }
    }

    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            for (int x = 0; x < 4; ++x) {
                int ii = i + di[x];
                int jj = j + dj[x];
                if (ii >= 0 && ii < N && jj >= 0 && jj < M && S[ii][jj] != '.') {
                    uft.unite(i * M + j, ii * M + jj);
                }
            }
        }
    }

    int ans = 0;
    int bn = 0, wn = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            int idx = i * M + j;
            if (uft.find(idx) == idx) {
                int b = uft.black(idx);
                int w = uft.white(idx);
                if (b < w) {
                    ans += 100 * b;
                    wn += w - b;
                } else {
                    ans += 100 * w;
                    bn += b - w;
                }
            }
        }
    }
    ans += 10 * min(bn, wn) + max(bn, wn) - min(bn, wn);
    
    cout << ans << "\n";

    return 0;
}