#include<bits/stdc++.h>
using namespace std;
char s[3005][3005];
bool vs[3005][3005],vt[3005][3005];
int zx[6005],zd[6005];
int X0[6005],Y0[6005];
int X1[6005],Y1[6005];
int X2[6005],Y2[6005];
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)scanf("%s",s[i]+1);
	if(s[1][1]=='.')vs[1][1]=1;
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(vs[i][j]){
		if(s[i+1][j]=='.')vs[i+1][j]=1;
		if(s[i][j+1]=='.')vs[i][j+1]=1;
	}
	int gs=0;
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j){
		if(s[i][j]=='.')++gs;
	}
	if(!vs[n][m]){
		printf("%lld\n",1ll*gs*(gs-1)/2);
		return 0;
	}
	if(s[n][m]=='.')vt[n][m]=1;
	for(int i=n;i>=1;--i)for(int j=m;j>=1;--j)if(vt[i][j]){
		if(s[i-1][j]=='.')vt[i-1][j]=1;
		if(s[i][j-1]=='.')vt[i][j-1]=1;
	}
	int X=1,Y=1;
	while(X+Y<n+m){
		if(s[X+1][Y]=='.'&&vt[X+1][Y])zx[X+Y]=0,++X;
		else zx[X+Y]=1,++Y;
	}
	X=1,Y=1;
	while(X+Y<n+m){
		if(s[X][Y+1]=='.'&&vt[X][Y+1])zd[X+Y]=1,++Y;
		else zd[X+Y]=0,++X;
	}
	X0[1]=1,Y0[1]=1;
	for(int i=2;i<=n+m-1;++i){
		if(zx[i])X0[i]=X0[i-1],Y0[i]=Y0[i-1]+1;
		else X0[i]=X0[i-1]+1,Y0[i]=Y0[i-1];
	}
	X1[1]=1,Y1[1]=1;
	for(int i=2;i<=n+m-1;++i){
		if(zd[i])X1[i]=X1[i-1],Y1[i]=Y1[i-1]+1;
		else X1[i]=X1[i-1]+1,Y1[i]=Y1[i-1];
	}
	long long ans=0;
	X=1,Y=1;
	int XX=1,YY=1;
	for(int i=1;i<=n+m-1;++i){
		int pp=X;
		for(int j=X-1;j>=XX;--j){
			if(vs[j][i+1-j]&&vt[j][i+1-j]){
				pp=j;
				break;
			}
		}
		if(pp==X){
			ans+=gs-i;
		}else{
			int X_=pp,Y_=i+1-pp;
			while(X_+Y_>2){
				X2[X_+Y_-1]=X_,Y2[X_+Y_-1]=Y_;
				if(s[X_][Y_-1]=='.'&&vs[X_][Y_-1])--Y_;
				else --X_;
			}
			X2[1]=X_,Y2[1]=Y_;
			X_=pp,Y_=i+1-pp;
			while(X_+Y_<n+m){
				if(s[X_+1][Y_]=='.'&&vt[X_+1][Y_])++X_;
				else ++Y_;
				X2[X_+Y_-1]=X_,Y2[X_+Y_-1]=Y_;
			}
			for(int j=1;j<=n+m-1;++j)if(X2[j]==X1[j]&&Y2[j]==Y1[j]){
				if(j<=i&&X2[j]==X0[j]&&Y2[j]==Y0[j])continue;
				++ans;
			}
		}
		if(zx[i+1])++Y;
		else ++X;
		if(zd[i+1])++YY;
		else ++XX;
	}
	printf("%lld\n",ans);
	return 0;
}