#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int a[110][110];
short int vis[110][110];
int n,m,ans;
int tx[4]={1,-1,0,0};
int ty[4]={0,0,1,-1};
struct node
{
	int x,y;
};
queue<node>q;
void bfs(int x,int y)
{
	node start;
	start.x=x;
	start.y=y;
	q.push(start);
	vis[x][y]=1;
	while(!q.empty())
	{
		int j;
		node now=q.front();
		for(j=0;j<4;j++)
		{
			int nx=now.x+tx[j];
			int ny=now.y+ty[j];
			if(nx<1||nx>n||ny<1||ny>n)
			{
				continue;
			}
			if(vis[nx][ny]==1)
			{
				continue;
			}
			if(a[nx][ny]==0)
			{
				continue;
			}
			vis[nx][ny]=1;
			node next;
			next.x=nx;
			next.y=ny;
			q.push(next);
		}
		q.pop();
	}
}
int main()
{
	int i,j;
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			scanf("%1d",&a[i][j]);
			vis[i][j]=0;
		}
	}
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(vis[i][j]==0&&a[i][j]!=0)
			{
				bfs(i,j);
				ans++;
			}
		}
	}
	cout<<ans;
	return 0;
}  

40分求调