#include <cstdio>
const int N = 105;
int n, m, ans = 0;
char g[N][N];
int dx[3] = {1, -1, 0};
int dy[3] = {1, -1, 0}; 
bool in(int x, int y) {
	return x >= 0 && x < n && y >= 0 && y < m;
}
void dfs (int x, int y) {
	g[x][y] = '.';
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			int a = x + dx[i], b = y + dy[j];
			if (in(a, b) && g[a][b] == 'W') {
				dfs(a, b);
			}
		}
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			scanf("%c", &g[i][j]);		
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (g[i][j] == 'W') {
				ans++;
				dfs(i, j);
			}
		}
	}
	printf("%d", ans);
	return 0;
}