# 近くに火が2つ以上あると良いマス候補 # それ以外には基本植物を置く n, m = map(int, input().split()) s = [input() for _ in range(n)] # type: # 火 : 0 # 植物固定 : 1 # 良いマス候補 : 2 type_b = [[0] * m for _ in range(n + 2)] type_mask = [0] * (n + 2) # 良いマス候補 01で for i in range(1, n + 1): for j in range(m): if s[i - 1][j] == '#': type_b[i][j] = 0 else: cnt = 0 for di in (-1, 0, 1): for dj in (-1, 0, 1): if di == 0 and dj == 0: continue ni, nj = i - 1 + di, j + dj if 0 <= ni < n and 0 <= nj < m: if s[ni][nj] == '#': cnt += 1 if cnt >= 2: type_b[i][j] = 2 type_mask[i] |= (1 << j) else: type_b[i][j] = 1 # 各行の植物の状態を列挙(植物あり : 1) b = [[] for _ in range(n + 2)] b[0] = [0] b[n + 1] = [0] for i in range(1, n + 1): for mask in range(1 << m): valid = True for j in range(m): bit = (mask & (1 << j)) != 0 if type_b[i][j] == 0 and bit: valid = False break if type_b[i][j] == 1 and not bit: valid = False break if valid: b[i].append(mask) # dp[(mask_prev2, mask_prev)] = max_score dp = {(0, 0): 0} for i in range(1, n + 2): next_dp = {} for (mask_prev2, mask_prev), val in dp.items(): # i行目の置き方を全探索、i-1行目のスコアの増え方を計算 for mask_now in b[i]: score = 0 if 1 <= i - 1 <= n: # 候補マスのうち、植物を置いていないマス able = type_mask[i - 1] & (~mask_prev) for j in range(m): if (able & (1 << j)): cnt = 0 if j > 0: if mask_prev2 & (1 << (j - 1)): cnt += 1 if mask_prev & (1 << (j - 1)): cnt += 1 if mask_now & (1 << (j - 1)): cnt += 1 if mask_prev2 & (1 << j): cnt += 1 if mask_now & (1 << j): cnt += 1 if j < m - 1: if mask_prev2 & (1 << (j + 1)): cnt += 1 if mask_prev & (1 << (j + 1)): cnt += 1 if mask_now & (1 << (j + 1)): cnt += 1 if cnt >= 2: score += 1 state = (mask_prev, mask_now) new_val = val + score if state in next_dp: next_dp[state] = max(new_val, next_dp[state]) else: next_dp[state] = new_val dp = next_dp ans = max(dp.values()) if dp else 0 print(ans)