#include<bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int N=3e3+5;
int n,m,cnt,num;
ll ans;
char s[N][N];
bool vis[N][N],path[N][N],f[N][N],g[N][N];
vector<int> pos[N<<1];
bool check(int x,int y){ return x&&y&&x<=n&&y<=m&&s[x][y]=='.'; }
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i){
		getchar();
		for(int j=1;j<=m;++j) num+=(s[i][j]=getchar())=='.';
	}
	f[1][1]=s[1][1]=='.';
	for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) if(i+j>2&&s[i][j]=='.') f[i][j]=f[i-1][j]|f[i][j-1];
	g[n][m]=s[n][m]=='.';
	for(int i=n;i;--i) for(int j=m;j;--j) if(i+j<n+m&&s[i][j]=='.') g[i][j]=g[i+1][j]|g[i][j+1];
	if(!g[1][1]) return printf("%lld\n",1ll*num*(num-1)>>1),0;
	for(int i=1;i<=n;++i) for(int j=1;j<=m;++j){
		if(!f[i][j]|!g[i][j]) s[i][j]='#';
		else pos[i+j].pb(i);
	}
	for(int i=2;i<=n+m;++i) if(pos[i].size()==1) ans+=--num;
	for(int i=2;i<=n+m;++i) if(pos[i].size()>1){
		int l=pos[i][1],r=pos[i][pos[i].size()-1];//del pos[i][0] + x
		for(int j=i+1;j<=n+m;++j){
			if(s[l][j-l]!='.') ++l;
			if(s[r+1][j-r-1]=='.') ++r;
			if(l==r&&pos[j].size()>1) ++ans;
		}
		l=pos[i][0],r=pos[i][pos[i].size()-2];//del pos[i][pos[i].size()-1] + x
		if(l==r) ++ans;//del pos[i][0] + pos[i][pos[i].size()-1]
		for(int j=i+1;j<=n+m;++j){
			if(s[l][j-l]!='.') ++l;
			if(s[r+1][j-r-1]=='.') ++r;
			if(l==r&&pos[j].size()>1) ++ans;
		}
	}
	printf("%lld\n",ans);
	return 0;
}