#include<bits/stdc++.h>
using namespace std;
const int maxn=3005;
#define pii pair<int,int> 
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
int cs[maxn][maxn],ct[maxn][maxn];
pii fu[maxn][maxn],fv[maxn][maxn],tu[maxn][maxn],tv[maxn][maxn];
int n,m,cnt;
char mp[maxn][maxn];
vector<pii>buc[maxn+maxn];
signed main(){
	cin.tie(0),cout.tie(0),ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>mp[i][j],cnt+=(mp[i][j]=='.');
	//presets
	if(mp[1][1]!='*')cs[1][1]=1;
	if(mp[n][m]!='*')ct[n][m]=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if((i==1&&j==1)||mp[i][j]=='*')continue;
			cs[i][j]=cs[i-1][j]|cs[i][j-1];
			if(!cs[i][j])continue;
			if(cs[i][j-1])fu[i][j]=mkp(i,j-1);
			else fu[i][j]=mkp(i-1,j);
			if(cs[i-1][j])fv[i][j]=mkp(i-1,j);
			else fv[i][j]=mkp(i,j-1);
		}
	}
	for(int i=n;i>=1;i--){
		for(int j=m;j>=1;j--){
			if((i==n&&j==m)||mp[i][j]=='*')continue;
			ct[i][j]=ct[i+1][j]|ct[i][j+1];
			if(!ct[i][j])continue;
			if(ct[i+1][j])tu[i][j]=mkp(i+1,j);
			else tu[i][j]=mkp(i,j+1);
			if(ct[i][j+1])tv[i][j]=mkp(i,j+1);
			else tv[i][j]=mkp(i+1,j);
		}
	} 
	if(!ct[1][1]||cnt<2){
		cout<<1ll*cnt*(cnt-1)/2;
		return 0;
	}
	for(int j=1;j<=m;j++){
		for(int i=1;i<=n;i++){
			if(!cs[i][j]||!ct[i][j]||buc[i+j].size()==2)continue;
			buc[i+j].push_back(mkp(i,j));
		}
	}
	//U,V
	vector<pii>U,V,S;
	pii now=mkp(1,1);
	while(1){
		U.push_back(now);
		if(now==mkp(n,m))break;
		now=tu[now.fi][now.se];
	}
	now=mkp(1,1);
	while(1){
		V.push_back(now);
		if(now==mkp(n,m))break;
		now=tv[now.fi][now.se];
	}
	int cc=0;
	long long ans=0;
	for(int i=0;i<U.size();i++){
		if(U[i]==V[i])cc++,ans+=1ll*(cnt-cc);
		else S.push_back(U[i]);
	}
	if(cc==U.size()){
		cout<<ans;
		return 0;
	}
	for(int i=0;i<S.size();i++){
		vector<pii>U_;
		now=buc[S[i].fi+S[i].se][1];
		while(1){
			U_.push_back(now);
			if(now==mkp(1,1))break;
			now=fu[now.fi][now.se];
		}
		reverse(U_.begin(),U_.end());
		now=buc[S[i].fi+S[i].se][1];
		now=tu[now.fi][now.se];
		while(1){
			U_.push_back(now);
			if(now==mkp(n,m))break;
			now=tu[now.fi][now.se];
		}
		for(int j=0;j<U_.size();j++)ans+=1ll*(U_[j]==V[j]&&U[j]!=U_[j]);
	}
	cout<<ans;
	return 0;
}