#include<iostream>
#include<cmath>
using namespace std;
char tu[150][150];
int ans=0;
int n,m;
void dfs(int x, int y)
{
tu[x][y]='.';
if(tu[x-2][y]=='#') dfs(x-2,y);
if(tu[x-1][y]=='#') dfs(x-1,y);
if(tu[x-1][y+1]=='#') dfs(x-1,y+1);
if(tu[x][y+1]=='#') dfs(x,y+1);
if(tu[x][y+2]=='#') dfs(x,y+2);
if(tu[x+1][y+1]=='#') dfs(x+1,y+1);
if(tu[x+2][y]=='#') dfs(x+2,y);
if(tu[x+1][y]=='#') dfs(x+1,y);
if(tu[x+1][y-1]=='#') dfs(x+1,y-1);
if(tu[x][y-1]=='#') dfs(x,y-1);
if(tu[x][y-2]=='#') dfs(x,y-2);
if(tu[x-1][y-1]=='#') dfs(x-1,y-1);
}
int main()
{
cin>>n>>m;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=m; j++)
{
cin>>tu[i][j];
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=m; j++)
{
if(tu[i][j]=='#')
{
ans++;
dfs(i,j);
}
}
}
cout<<ans;
return 0;
}