#include <bits/stdc++.h>
using namespace std;
int V, match[2509], used[2509]; vector<int> G[2509];
bool search(int v) {
	used[v] = 1;
	for (int u : G[v]) {
		int 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;
	fill(match, match + V, -1);
	for (int i = 0; i < V; i++) {
		if (match[i] < 0) {
			fill(used, used + V, 0);
			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 w = 0, b = 0;
	for(int i = 0; i < H; i++) {
		for(int j = 0; j < W; j++) {
			if(s[i][j] == 'w') w++;
			if(s[i][j] == 'b') b++;
		}
	}
	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(w, b) - res1;
	int res3 = w + b - res1 * 2 - res2 * 2;
	cout << res1 * 100 + res2 * 10 + res3 << endl;
	return 0;
}