#include<bits/stdc++.h>
using namespace std;
bool f[110][110];
char a[110][110];
int fx[4][2] = {{0,1},{1,0},{0,-1},{-1,0}},c,n,m;
void dfs(int x,int y){
    f[x][y] = true;
    int tx,ty;
    for(int i = 0;i < 4;i++){
        tx = x + fx[i][0];
        ty = y + fx[i][1];
        if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]!='0'&&f[tx][ty]==false){
            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]!='0'&&f[i][j]==false){
                c++;
                dfs(i,j);
            }
        }
    }
    cout<<c;
}
/**************************************************************
	Problem: 1907
	User: liyunshuo
	Language: C++
	Result: Accepted
	Time:15 ms
	Memory:2348 kb
****************************************************************/