#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
char a[101][101];
bool f[101][101];
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
void dfs(int x,int y){
    f[x][y]=true;
    for(int i=0;i<=3;i++){
        int zx=x+fx[i];
        int zy=y+fy[i];
        if(zx>=1&&zx<=n&&zy>=1&&zy<=m&&a[zx][zy]!='0'&&f[zx][zy]==false){
            dfs(zx,zy);
        }
    }
}
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]!='0'&&f[i][j]==false){
                ans++;
                dfs(i,j);
            }
        }
    }
    cout<<ans;
    return 0;
}
 
/**************************************************************
	Problem: 1907
	User: jzh
	Language: C++
	Result: Accepted
	Time:8 ms
	Memory:2432 kb
****************************************************************/