#include<bits/stdc++.h>
using namespace std;
int n,m,k;
char a[101][101];
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
void dfs(int x,int y){
    a[x][y]='.';
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]=='W'){
			dfs(tx,ty);
		}
	}
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		cin>>a[i][j];
    	}
    }
    
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		if(a[i][j]=='W'){
    			k++;
    			dfs(i,j);
    			
    		}
    		
    	}
    }
    cout<<k;
	return 0;
}
// 1 2 3 4 5
//1    
//2    x 0,1
//3    1 0
//4
/**************************************************************
	Problem: 1434
	User: chenjingqi
	Language: C++
	Result: Accepted
	Time:25 ms
	Memory:2084 kb
****************************************************************/