#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
char a[200][200];
int dx[12]={1,0,1,-1,1,-1,0,-1,2,0,-2,0};
int dy[12]={0,1,1,-1,-1,0,-1,0,0,2,0,-2};
void dfs(int x,int y){
    a[x][y]='-';
    for(int i=0;i<=11;i++){
        int tx=x+dx[i];
        int ty=y+dy[i];
        if(a[tx][ty]=='#'&&tx>=1&&tx<=n&&ty>=1&&ty<=m){
             
            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]=='#')
            {
                a[i][j]='-';
                dfs(i,j);
                ans++;
            }   
        }
    }
    cout<<ans; 

    
	return 0;
}

/**************************************************************
	Problem: 1966
	User: wuzhehan
	Language: C++
	Result: Wrong Answer
****************************************************************/