# 誤解法: 候補マス(火が2個以上隣接する空きマス)は全部植えず、それ以外の空きマスに全部植えて数える 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)) cand = [[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 cand[x][y] return sum(1 for i in range(N) for j in range(M) if cand[i][j] and cnt(i, j, plant) >= 2) d = sys.stdin.read().split(); N, M = int(d[0]), int(d[1]) print(solve(N, M, d[2:2+N]))