// Problem: C. Cells Blocking
// Contest: Codeforces - 300iq Contest 3
// URL: https://codeforces.com/gym/102538/problem/C
// Memory Limit: 512 MB
// Time Limit: 3000 ms
// Written by yinhee.

#include<bits/stdc++.h>
using namespace std;
namespace my_std{
#define mems(x,y) memset(x,y,sizeof x)
#define Mp make_pair
#define eb emplace_back
#define gc getchar
#define pc putchar
#define fi first
#define se second
#define il inline
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define drep(i,a,b) for(int i=(a);i>=(b);i--)
#define go(i,u) for(int i=head[u];i;i=e[i].nxt)
	typedef long long ll;
	typedef pair<int,int> pii;
	template<typename T>inline T read(){
		T x=0,f=1;char c=gc();
		while(!isdigit(c)){if(c=='-')f=-1;c=gc();}
		while(isdigit(c))x=x*10+c-48,c=gc();
		return x*f;
	}
}
using namespace my_std;
const int N=3e3+7,M=-1,inf=0x3f3f3f3f,mod=0;
int n,m,inc[N][N];char s[N];vector<pii> h;
bool a[N][N],f[N][N],g[N][N],pd[N][N],vis[N][N];
void Yorushika(){
	scanf("%d%d",&n,&m);
	rep(i,1,n){
		scanf("%s",s+1);
		rep(j,1,m)a[i][j]=s[j]=='*';
	}
	f[1][1]=!a[1][1];
	rep(i,1,n)rep(j,1,m){
		if(i==1&&j==1||a[i][j])continue;
		f[i][j]=f[i-1][j]|f[i][j-1];
	}
	g[n][m]=!a[n][m];
	drep(i,n,1)drep(j,m,1){
		if(i==n&&j==m||a[i][j])continue;
		g[i][j]=g[i+1][j]|g[i][j+1];
	}
	bool fl=0;
	rep(i,1,n)rep(j,1,m)fl|=(pd[i][j]=f[i][j]&&g[i][j]);
	if(!fl){
		int cnt=0;
		rep(i,1,n)rep(j,1,m)cnt+=!a[i][j];
		printf("%lld\n",1ll*cnt*(cnt-1)/2);
		return;
	}
	int x=1,y=1;ll ans=0;
	h.eb(Mp(x,y)),inc[1][1]=2;
	while(x<n||y<m){
		if(pd[x+1][y])x++;
		else y++;
		h.eb(Mp(x,y)),inc[x][y]++;
	}
	x=1,y=1,vis[1][1]=1;
	while(x<n||y<m){
		if(pd[x][y+1])y++;
		else x++;
		vis[x][y]=1,inc[x][y]++;
	}
	for(pii i:h){
		if(inc[i.fi][i.se]==2)continue;
		int x=i.fi-1,y=i.se+1;
		while(!pd[x][y]&&x&&y<=m)x--,y++;
		if(!pd[x][y])continue;
		int a=x,b=y;ans+=vis[a][b];
		while(a>1||b>1){
			if(pd[a][b-1])b--;
			else a--;
			ans+=vis[a][b];
		}
		a=x,b=y;
		while(a<n||b<m){
			if(pd[a+1][b])a++;
			else b++;
			ans+=vis[a][b];
		}
	}
	int cnt0=0,cnt2=0;
	rep(i,1,n)rep(j,1,m)cnt0+=!inc[i][j]&&!a[i][j]||inc[i][j]==1&&vis[i][j];
	rep(i,1,n)rep(j,1,m)cnt2+=inc[i][j]==2;
	ans+=1ll*cnt2*cnt0+1ll*cnt2*(cnt2-1)/2;
	printf("%lld\n",ans);
	
}
signed main(){
	int t=1;
	//	scanf("%d",&t);
	while(t--)
		Yorushika();
}