#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1000 + 10;
int xy[8][2]={{-1,1},{0,1},{1,1},{-1,-1},{0,-1},{1,-1},{-1,0},{1,0}};
int r, c, s, G[N][N];
void DFS(int x, int y) {
    if(G[x][y] > 0) {
        G[x][y] = -1;
        for(int i=0; i<8; i++)
            DFS(x+xy[i][0], y+xy[i][1]);
    }
}
int main() {
    freopen("badgras.in", "r", stdin);
    freopen("badgras.out", "w", stdout);
    scanf("%d %d", &r, &c);
    for(int i=1; i<=r; i++)
        for(int j=1; j<=c; j++)
            scanf("%d", G[i]+j);
    for(int i=1; i<=r; i++)
        for(int j=1; j<=c; j++)
            if(G[i][j] > 0) {
                DFS(i, j);
                s++;
            }
    printf("%d\n", s);
    return 0;
}