H,W = map(int,input().split())
A = [list(map(int,input().split())) for _ in range(H)]

count = 0
stack = []
for h in range(H):
    for w in range(W):
        if A[h][w] == 1:
            count += 1
            stack.append((h,w))
            A[h][w] = 0
            while stack:
                h,w = stack.pop()
                for i,j in [(0,1),(0,-1),(1,0),(-1,0)]:
                    if 0 <= h + i < H and 0 <= w + j < W:
                        if A[h+i][w+j]:
                            A[h+i][w+j] = 0
                            stack.append((h+i,w+j))
print(count)