#include<bits/stdc++.h>
using namespace std;
int n,m,ans=0;;
char a[101][101];
int fx[12]={1,0,-1,0,1,-1,1,-1,2,0,0,-2};
int fy[12]={0,1,0,-1,1,1,-1,-1,0,2,-2,0};
void dfs(int x,int y)
{
       
    for(int i=0;i<=11;i++)
    {
        int tx=x+fx[i];
        int ty=y+fy[i];
        if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]=='#')
        {
            a[tx][ty]='-';
            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; 
}
 
/**************************************************************
	Problem: 1966
	User: wuzhehan
	Language: C++
	Result: Accepted
	Time:20 ms
	Memory:2084 kb
****************************************************************/