#include<bits/stdc++.h>
using namespace std;
//#define int long long
//#define mod 1000000007
#define N 4005
#define pii pair<int,int>
#define fi first
#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int n,m;
char s[N][N];
int t[N][N],t2[N][N];
int num[N][N];
int tot=0;
int nt[N*N],hd[N*N],x[N*N],qwq;
int f[N*N][3],deg[N*N];
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>(s[i]+1);
	queue<pii>q;
	q.push({1,1});
	t[1][1]=1;
	while(q.size()){
		int x=q.front().fi,y=q.front().se;
		q.pop();
		if(x<n&&!t[x+1][y]&&s[x+1][y]=='.')q.push({x+1,y}),t[x+1][y]=1;
		if(y<m&&!t[x][y+1]&&s[x][y+1]=='.')q.push({x,y+1}),t[x][y+1]=1;
	}
	q.push({n,m});
	t2[n][m]=1;
	while(q.size()){
		int x=q.front().fi,y=q.front().se;
		q.pop();
		if(x>1&&!t2[x-1][y]&&s[x-1][y]=='.')q.push({x-1,y}),t2[x-1][y]=1;
		if(y>1&&!t2[x][y-1]&&s[x][y-1]=='.')q.push({x,y-1}),t2[x][y-1]=1;
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)t[i][j]&=t2[i][j];
	if(s[1][1]=='*'||s[n][m]=='*'||!t[n][m]){
		int c=0;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)c+=(s[i][j]=='.');
		if(c>=2)cout<<c*(c-1)/2;
		else cout<<0;
		return 0;
	}
	for(int i=n+1;i;i--){
		for(int j=m+1;j;j--){
			if(num[i][j]||(i==n+1&&j==m+1)||(i==1&&j==1))continue;
			num[i][j]=++tot;
			queue<pii>q;
			q.push({i,j});
			while(q.size()){
				int x=q.front().fi,y=q.front().se;
				q.pop();
				if(x>1&&!num[x-1][y]&&(!(t[x-1][y-1]&t[x-1][y])))q.push({x-1,y}),num[x-1][y]=tot;
				if(y>1&&!num[x][y-1]&&(!(t[x-1][y-1]&t[x][y-1])))q.push({x,y-1}),num[x][y-1]=tot;
			}
		}
	}
	// for(int i=1;i<=n+1;i++){
		// for(int j=1;j<=m+1;j++)cout<<num[i][j]<<' ';cout<<endl;
	// }
	int S=num[2][1],T=num[1][2];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(t[i][j]){
				nt[++qwq]=hd[num[i+1][j]];
				x[qwq]=num[i][j+1];
				hd[num[i+1][j]]=qwq;
				deg[num[i][j+1]]++;
			}
		}
	}
	queue<int>qq;
	qq.push(S);
	f[S][0]=1;
	while(qq.size()){
		int u=qq.front();qq.pop();
		for(int i=hd[u];i;i=nt[i]){
			int v=x[i];
			deg[v]--;
			f[v][1]+=f[u][0];
			f[v][2]+=f[u][1];
			if(deg[v]==0)qq.push(v);
		}
	}
	int c=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)c+=(s[i][j]=='.');
	cout<<(f[T][1]*(c-1)-f[T][1]*(f[T][1]-1)/2)+f[T][2];
	return 0;
}