#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
char mat[3005][3005];
int vis1[3005][3005],vis2[3005][3005];
int vis[3005][3005];
void dfs1(int x,int y){
	if(vis1[x][y])return;
	vis1[x][y]=1;
	if(mat[x+1][y]=='.')dfs1(x+1,y);
	if(mat[x][y+1]=='.')dfs1(x,y+1);
}
void dfs2(int x,int y){
	if(vis2[x][y])return;
	vis2[x][y]=1;
	if(mat[x-1][y]=='.')dfs2(x-1,y);
	if(mat[x][y-1]=='.')dfs2(x,y-1);
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%s",mat[i]+1);
	int num=0;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)num+=(mat[i][j]=='.');
	if(mat[1][1]=='.')dfs1(1,1);
	if(!vis1[n][m]){
		printf("%lld\n",1ll*num*(num-1)/2);
		return 0;
	}
	dfs2(n,m);
	int x=1,y=1;
	while(x<n||y<m){
		vis[x][y]=1;
		if(y<m&&vis2[x][y+1])y++;
		else x++;
	}
	vis[x][y]=-1;
	x=y=1;
	ll ans=0;int cnt=0;
	while(x<n||y<m){
		if(vis[x][y])vis[x][y]=-1,cnt++;
		if(x<n&&vis2[x+1][y])x++;
		else y++;
	}
	x=y=1;
	while(x<n||y<m){
		if(!vis[x][y]){
			for(int i=x-1,j=y+1;i>=1&&j<=m;i--,j++)if(vis1[i][j]&&vis2[i][j]){
				// printf("i=%d j=%d\n",i,j);
				if(vis[i][j]==1)ans++;
				int xx=i,yy=j;
				while(xx>1||yy>1){
					if(yy>1&&vis1[xx][yy-1])yy--;
					else xx--;
					if(vis[xx][yy]==1)ans++;
				}
				xx=i,yy=j;
				while(xx<n||yy<m){
					if(xx<n&&vis2[xx+1][yy])xx++;
					else yy++;
					if(vis[xx][yy]==1)ans++;
				}
				break;
			}
			// printf("x=%d y=%d ans=%lld\n",x,y,ans);
		}
		if(x<n&&vis2[x+1][y])x++;
		else y++;
	}
	cnt++;
	// printf("cnt=%d num=%d\n",cnt,num);
	printf("%lld\n",ans+1ll*cnt*(num-1)-1ll*cnt*(cnt-1)/2);
	return 0;
}