H,W=map(int,input().split()) S=[] for _ in range(H): S.append(input()) down=[[0]*(W+1) for _ in range(H+1)] up=[[0]*(W+1) for _ in range(H+1)] for i in range(H): for j in range(W): if S[i][j]=='#': down[i][j]+=1 up[i][j]+=1 if i!=H-1 and j!=W-1 and S[i+1][j+1]=='#': down[i+1][j+1]+=down[i][j] if i!=H-1 and j!=0 and S[i+1][j-1]=='#': up[i+1][j-1]+=up[i][j] ansdown=[[0]*(W+1) for _ in range(H+1)] ansup=[[0]*(W+1) for _ in range(H+1)] for i in range(1,H-1): for j in range(1,W-1): if S[i][j]=='#' and S[i-1][j-1]=='#' and S[i-1][j+1]=='#' and S[i+1][j-1]=='#' and S[i+1][j+1]=='#': left,right=0,10**6//2+1 while right-left>1: mid=(right+left)//2 x=i+mid y=j+mid xs=i-mid-1 ys=j-mid-1 x2=i+mid y2=j-mid xs2=i-mid-1 ys2=j+mid+1 if 0<=x