# TLE 解法: 候補マスのどれを良いマスにするかを 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 nb(i, j): return [(i+a, j+b) for a, b in D if 0 <= i+a < N and 0 <= j+b < M] C = [(i, j) for i in range(N) for j in range(M) if S[i][j] == '.' and sum(S[x][y] == '#' for x, y in nb(i, j)) >= 2] best = 0 for bits in range(1 << len(C)): G = {C[k] for k in range(len(C)) if bits >> k & 1} if len(G) <= best: continue if all(sum(S[x][y] == '.' and (x, y) not in G for x, y in nb(i, j)) >= 2 for i, j in G): best = len(G) return best d = sys.stdin.read().split(); N, M = int(d[0]), int(d[1]) print(solve(N, M, d[2:2+N]))