import copy
m, n = map(int, input().split())
city = [[0] * (m + 2)]
cnt = 0
ans = 0
for _ in range(n):
arr = [0]
a = input()
for k in a:
arr.append(int(k))
arr.append(0)
city.append(arr)
city.append([0] * (m + 2))
City = copy.deepcopy(city)
def dfs(y, x, mode):
global cnt
if mode == 1:
if City[y][x] == 1:
cnt += 1
City[y][x] = 0
dfs(y, x-1, mode)
dfs(y, x + 1, mode)
else:
if City[y][x] == 1:
cnt += 1
City[y][x] = 0
dfs(y-1, x, mode)
dfs(y+1, x, mode)
for i in range(1, n + 1):
for j in range(1, m + 1):
for m in range(0, 2):
cnt = 0
City = copy.deepcopy(city)
dfs(i, j, m)
if cnt > 0:
ans += 1
print(ans)