#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=2e6,M=1111;
const double eps=1e-9;
struct xy{
	int x,y;double c,d;
	void rd(){cin>>c>>d;x=c*100;y=d*100;}
	void cd(int X,int Y){
		x-=X;y-=Y;
		c=(x||y)?atan2(x,y):9.0;
		d=sqrt(x*x+y*y);
		x+=X;y+=Y;
	}
}p[N];
int ck(xy a,xy b,xy c){return (b.x-a.x)*(c.y-b.y)-(c.x-b.x)*(b.y-a.y);}
vector<xy>TB(vector<xy>a){
	if(a.size()<3)return a;
	sort(a.begin(),a.end(),[&](xy a,xy b){return a.x==b.x?a.y<b.y:a.x<b.x;});
	for(xy&e:a)e.cd(a[0].x,a[0].y);
	sort(a.begin(),a.end(),[&](xy a,xy b){return fabs(a.c-b.c)<eps?a.d>b.d:a.c<b.c;});
	vector<xy>b;int m=0;
	for(xy e:a){
		for(;m>1&&ck(b[m-2],b[m-1],e)>=0;--m)b.pop_back();
		b.push_back(e);++m;
	}
	return b;
}
double d(xy a,xy b){return sqrt((b.y-a.y)*(b.y-a.y)+(b.x-a.x)*(b.x-a.x));}
#define vi vector<xy>
int b[M][M],v[M][M],fa[N],x,y;vi q[N];char c[M][M];
int fifa(int x){return x==fa[x]?x:fa[x]=fifa(fa[x]);}
inline void OL(xy a,xy b,xy c){if(abs(ck(a,b,c))<=d(a,b)*2)v[c.x][c.y]=1;}
inline int clc(vi a){
	vi b=TB(a);
	int n=0,m=b.size(),s=0,x,y;
	for(xy e:a)f(i,1,m)OL(b[i-1],b[i%m],e);
	for(xy e:a)if(v[e.x][e.y])v[e.x][e.y]=++n,fa[n]=n;
	for(xy e:a)if(x=v[e.x][e.y])f(p,-2,2)f(q,-2,2)if(y=v[e.x+p][e.y+q])fa[fifa(x)]=fifa(y);
	for(xy e:a)if(x=v[e.x][e.y])s+=fa[x]==x,v[e.x][e.y]=0;
	return s<3?1:5;
}
signed main(){
	cin>>n>>m;
	f(i,1,n)scanf("%s",c[i]+1);
	f(i,1,n)f(j,1,m)if(c[i][j]=='#')p[b[i][j]=++s]={i,j},fa[s]=s;
	f(i,1,n)f(j,1,m)if(x=b[i][j])f(p,-1,1)f(q,-1,1)if(y=b[i+p][j+q])fa[fifa(x)]=fifa(y);
	f(i,1,s)q[fifa(i)].push_back(p[i]);
	f(i,1,s)if(q[i].size())l+=clc(q[i]);
	cout<<l-5;
	return 0;
}