# 誤解法: 候補マスを全部「良いマス」にしておき、条件を満たさないマスがある限り # そのマスに植物を植える(=良いマスから外す)ことを繰り返す貪欲 import sys def solve(N, M, S): D = [(a, b) for a in (-1, 0, 1) for b in (-1, 0, 1) if (a, b) != (0, 0)] def cnt(i, j, pred): return sum(1 for a, b in D if 0 <= i+a < N and 0 <= j+b < M and pred(i+a, j+b)) good = [[S[i][j] == '.' and cnt(i, j, lambda x, y: S[x][y] == '#') >= 2 for j in range(M)] for i in range(N)] plant = lambda x, y: S[x][y] == '.' and not good[x][y] changed = True while changed: changed = False for i in range(N): for j in range(M): if good[i][j] and cnt(i, j, plant) < 2: good[i][j] = False changed = True return sum(map(sum, good)) d = sys.stdin.read().split(); N, M = int(d[0]), int(d[1]) print(solve(N, M, d[2:2+N]))