// created:  2024-09-03 15:53:57
#include<cstdio>
#include<cctype>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef long long ll;
constexpr int N=3005;
struct pos2d
{
	int x,y;
};
int n,m,len,fa[N][N],fb[N][N],laa[2*N],lab[2*N],lba[2*N],lbb[2*N];
ll ans;
pos2d a[2*N],b[2*N];
char s[N][N],f[N][N];
int main()
{
	read(n,m);
	F(i,0,n)scanf("%s",s[i]);
	int t0=0;
	F(i,0,n)F(j,0,m)t0+=s[i][j]=s[i][j]=='.';
	f[0][0]=s[0][0];
	F(i,1,n)f[i][0]=f[i-1][0]&s[i][0];
	F(i,1,m)f[0][i]=f[0][i-1]&s[0][i];
	F(i,1,n)F(j,1,m)f[i][j]=(f[i-1][j]|f[i][j-1])&s[i][j];
	if(!f[n-1][m-1])return printf("%lld\n",t0*(t0-1ll)>>1),0;
	len=n+m-1;
	for(int i=len-1,x=n-1,y=m-1;;)
	{
		a[i]={x,y};
		s[x][y]=2;
		if(!~--i)break;
		if(y&&(!x||f[x][y-1]))--y;
		else --x;
	}
	for(int i=len-1,x=n-1,y=m-1;;)
	{
		b[i]={x,y};
		s[x][y]=2;
		if(!~--i)break;
		if(x&&(!y||f[x-1][y]))--x;
		else --y;
	}
	int l=0,t1=1;
	F(r,1,len)
	{
		if(a[r].x!=b[r].x)continue;
		int lx=a[l].x,ly=a[l].y,rx=a[r].x,ry=a[r].y;
		F(i,lx,rx+1)F(j,ly,ry+1)fa[i][j]=fb[i][j]=-1;
		F(i,l,r+1)fa[a[i].x][a[i].y]=i,fb[b[i].x][b[i].y]=i;
		for(int i=rx;--i>=lx;)for(int j=ry;--j>=ly;)if(s[i][j]==1)
		{
			fa[i][j]=max(fa[i][j],fa[i][j+1]);
			fa[i][j]=max(fa[i][j],fa[i+1][j]);
			fb[i][j]=max(fb[i][j],fb[i][j+1]);
			fb[i][j]=max(fb[i][j],fb[i+1][j]);
		}
		F(i,l,r)
		{
			if(a[i].x<rx)fa[a[i].x][a[i].y]=max(fa[a[i].x][a[i].y],fa[a[i].x+1][a[i].y]);
			if(a[i].y<ry)fa[a[i].x][a[i].y]=max(fa[a[i].x][a[i].y],fa[a[i].x][a[i].y+1]);
			if(b[i].x<rx)fa[b[i].x][b[i].y]=max(fa[b[i].x][b[i].y],fa[b[i].x+1][b[i].y]);
			if(b[i].y<ry)fa[b[i].x][b[i].y]=max(fa[b[i].x][b[i].y],fa[b[i].x][b[i].y+1]);
			if(a[i].x<rx)fb[a[i].x][a[i].y]=max(fb[a[i].x][a[i].y],fb[a[i].x+1][a[i].y]);
			if(a[i].y<ry)fb[a[i].x][a[i].y]=max(fb[a[i].x][a[i].y],fb[a[i].x][a[i].y+1]);
			if(b[i].x<rx)fb[b[i].x][b[i].y]=max(fb[b[i].x][b[i].y],fb[b[i].x+1][b[i].y]);
			if(b[i].y<ry)fb[b[i].x][b[i].y]=max(fb[b[i].x][b[i].y],fb[b[i].x][b[i].y+1]);
		}
		F(i,l,r+1)laa[i]=fa[a[i].x][a[i].y],lab[i]=fa[b[i].x][b[i].y],lba[i]=fb[a[i].x][a[i].y],lbb[i]=fb[b[i].x][b[i].y];
		F(i,l+1,r+1)laa[i]=max(laa[i],laa[i-1]),lba[i]=max(lba[i],lba[i-1]),lab[i]=max(lab[i],lab[i-1]),lbb[i]=max(lbb[i],lbb[i-1]);
		F(i,l+1,r)if(laa[i-1]<=i)F(j,l+1,r)if(lbb[j-1]<=j&&lba[i-1]<=j&&lab[j-1]<=i)++ans;
		++t1;
		l=r;
	}
	ans+=t1*(2ll*t0-t1-1)>>1;
	printf("%lld\n",ans);
	return 0;
}