tj

# 读取行数和列数
r, c = map(int, input().split())
# 存储牧场地图
pasture = []
for _ in range(r):
    pasture.append(list(input()))

# 深度优先搜索函数，用于标记已访问的草丛
def dfs(x, y):
    if x < 0 or x >= r or y < 0 or y >= c or pasture[x][y] == '.':
        return
    pasture[x][y] = '.'
    dfs(x - 1, y)
    dfs(x + 1, y)
    dfs(x, y - 1)
    dfs(x, y + 1)

count = 0
for i in range(r):
    for j in range(c):
        if pasture[i][j] == '#':
            count += 1
            dfs(i, j)

print(count)