#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=3e3+3;
int n,m;
bool mp[N][N],f[N][N],g[N][N];
pii L[N<<1],R[N<<1];
pii LL[N<<1];
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read(),m=read();
	rep(i,1,n){
		static char S[N];scanf("%s",S+1);
		rep(j,1,m)mp[i][j]=S[j]=='*';
	}
	f[n][m]=!mp[n][m];
	g[1][1]=!mp[1][1];
	per(i,n,1)per(j,m,1)if(!mp[i][j]){
		if(i<n)f[i][j]|=f[i+1][j];
		if(j<m)f[i][j]|=f[i][j+1];
	}
	rep(i,1,n)rep(j,1,m)if(!mp[i][j]){
		if(i>1)g[i][j]|=g[i-1][j];
		if(j>1)g[i][j]|=g[i][j-1];
	}
	int emp=0;
	rep(i,1,n)rep(j,1,m)emp += !mp[i][j];
	if(!f[1][1]){
		printf("%lld",1ll*emp*(emp-1)/2);
		return 0;
	}
	int px=1,py=1;
	rep(i,1,n+m-1){
		L[i]=P(px,py);
		if(f[px+1][py])++px;
		else ++py;
	}
	px=1,py=1;
	rep(i,1,n+m-1){
		R[i]=P(px,py);
		if(f[px][py+1])++py;
		else ++px;
	}
	ll ans=0;int cnt1=0;
	rep(i,1,n+m-1)if(L[i]==R[i])++cnt1;
	ans += 1ll*cnt1*(emp-cnt1) + 1ll*cnt1*(cnt1-1)/2;
	rep(i,2,n+m-1)if(L[i]!=R[i]){
		int x=L[i].fi-1,y=L[i].se+1;
		while(x>=1&&y<=m&&(!g[x][y]||!f[x][y]))--x,++y;
		assert(x>=1&&y<=m);
		int k=x+y-1;
		int px=x,py=y;
		per(i,k,1){
			LL[i]=P(px,py);
			if(g[px][py-1])--py;
			else --px;
		}
		px=x,py=y;
		rep(i,k,n+m-1){
			LL[i]=P(px,py);
			if(f[px+1][py])++px;
			else ++py;
		}
		int cnt=0;
		rep(j,1,n+m-1)cnt += LL[j]==R[j]&&L[j]!=R[j];
		ans += cnt;
	}
	cout<<ans;
    return 0;
}