#include<iostream>#include<queue>using namespace std;struct Node{int x;int y;};int dir[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,-1},{-1,1},{1,1},{-1,-1}};char map[105][105];int num;int n,m;void BFS(int x,int y){queue<Node>q;int tx,ty;int i,j;Node t,p;t.x=x;t.y=y;q.push(t);while(!q.empty()){p=q.front();q.pop();for(i=0;i<8;i++){tx=p.x+dir[i][0];ty=p.y+dir[i][1];if(tx>=0&&tx<n&&ty>=0&&ty<m&&map[tx][ty]=='W'){t.x=tx;t.y=ty;q.push(t);map[tx][ty]='.';}}}}int main(){int i,j;while(scanf("%d%d",&n,&m)!=EOF){num=0;for(i=0;i<n;i++){scanf("%s",map[i]);}for(i=0;i<n;i++){for(j=0;j<m;j++){if(map[i][j]=='W'){num++;BFS(i,j);}}}printf("%dn",num);}return 0;}
