#include <iostream>
#include <cstring>
using namespace std;

int idx[51][81],m,n,ans = 0;
char a[51][81];

void dfs(int x,int y,int id){
    if (x < 0 || x >= m || y < 0 || y >= n) return;
    if (idx[x][y] > 0 || a[x][y] == '0') return;
    idx[x][y] = id;
　　 // 上下左右搜索
    dfs(x - 1,y,id);
    dfs(x + 1,y,id);
    dfs(x,y + 1,id);
    dfs(x,y - 1,id);
}

int main(){
    memset(a,0,sizeof(a));
    memset(idx,0,sizeof(idx));
    cin >> m >> n;
    for (int i = 0;i < m;i++){
        cin >> a[i];
    }
    int cnt = 0;
    for (int i = 0;i < m;i++){
        for (int j = 0;j < n;j++){
            if (idx[i][j] == 0 && a[i][j] != '0'){
                dfs(i,j,++cnt);
            }
        }
    }
    cout << cnt; 
    return 0;
}