#include <vector>
#include <cstring>
#include <iostream>

using namespace std;

// ------ Variable ------ //
int V, match[2509], used[2509]; vector<int> G[2509];

// ------ Bipartite_Matching ------ //
bool search(int v) {
	used[v] = true;
	for (int i = 0; i < G[v].size(); i++) {
		int u = G[v][i], w = match[u];
		if (w < 0 || !used[w] && search(w)) {
			match[v] = u;
			match[u] = v;
			return true;
		}
	}
	return false;
}
int bipartite_matching() {
	int res = 0;
	memset(match, -1, sizeof(match));
	for (int i = 0; i < V; i++) {
		if (match[i] < 0) {
			memset(used, 0, sizeof(used));
			if (search(i)) res++;
		}
	}
	return res;
}
void add_edge(int a, int b) {
	G[a].push_back(b);
	G[b].push_back(a);
}
int H, W; string s[55];
int main() {
	cin >> H >> W; V = H * W;
	for(int i = 0; i < H; i++) cin >> s[i];
	int wcnt = 0, bcnt = 0, acnt = 0;
	for(int i = 0; i < H; i++) {
		for(int j = 0; j < W; j++) {
			if(s[i][j] == 'w') wcnt++, acnt++;
			if(s[i][j] == 'b') bcnt++, acnt++;
		}
	}
	for(int i = 0; i < H; i++) {
		for(int j = 0; j < W - 1; j++) {
			if(s[i][j] != '.' && s[i][j + 1] != '.') {
				add_edge(i * W + j, i * W + j + 1);
			}
		}
	}
	for(int i = 0; i < H - 1; i++) {
		for(int j = 0; j < W; j++) {
			if(s[i][j] != '.' && s[i + 1][j] != '.') {
				add_edge(i * W + j, i * W + j + W);
			}
		}
	}
	int res1 = bipartite_matching();
	int res2 = min(wcnt, bcnt) - res1;
	int res3 = acnt - res1 * 2 - res2 * 2;
	cout << res1 * 100 + res2 * 10 + res3 << endl;
	return 0;
}