#include<bits/stdc++.h>
using namespace std;
int n;
int m;
const int N = 105;
char a[N][N];
bool vis[N][N];
int ans;
const int dx[] = {0,0,-1,1};
const int dy[] = {-1,1,0,0};

void dfs(int x,int y){
	vis[x][y] = true;
	for(int i = 0;i<4;i++){
		int nx = x + dx[i];
		int ny = y + dy[i];
		if(1<=nx&&nx<=n&&1<=ny&&ny<=m&&!vis[nx][ny]&&a[nx][ny]!='0'){
			dfs(nx,ny);
		}
	}
	return ;
}

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(!vis[i][j]&&a[i][j]!='0'){
				ans++;
				vis[i][j] = true;
				dfs(i,j);
			}
		}
	}
	cout<<ans;
	return 0;
}

#include<bits/stdc++.h> using namespace std;

int n,m,a[110][110],ans; int dx[4]={-1,0,1,0,}; int dy[4]={0,1,0,-1};

void dfs(int x,int y) { a[x][y]=0; for(int i=0;i<4;i++) { int px=x+dx[i]; int py=y+dy[i]; if(a[px][py]) dfs(px,py); } } int main () { cin>>n>>m; for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) { char ch; cin>>ch; a[i][j]=ch-'0'; } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if(a[i][j]) { ans++; dfs(i,j); } } cout<<ans<<endl; return 0; }