#include<bits/stdc++.h>
#define Maxn 6003
#define LL long long
using namespace std;
int n,m;
LL white,ans,sam;
char s[Maxn][Maxn];
int f[Maxn][Maxn],g[Maxn][Maxn];
int lx[Maxn],ly[Maxn],rx[Maxn],ry[Maxn],tx[Maxn],ty[Maxn],tot;
void pre(){
	scanf("%d%d",&n,&m);
	for(int i=1; i<=n; i++){
		scanf("%s",s[i]+1);
		for(int j=1; j<=m; j++){
			white += (s[i][j] == '.');
		}
	}
	f[n][m] = 1;
	for(int i=n; i>=1; i--){
		for(int j=m; j>=1; j--){
			if(i<n && f[i+1][j]){ f[i][j] = 1; }
			if(j<m && f[i][j+1]){ f[i][j] = 1; }
			if(s[i][j] == '*'){ f[i][j] = 0; }
		}
	}
	g[1][1] = 1;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(i>1 && g[i-1][j]){ g[i][j] = 1; }
			if(j>1 && g[i][j-1]){ g[i][j] = 1; }
			if(s[i][j] == '*'){ g[i][j] = 0; }
		}
	}
}
void qry_left(){
	//left_most
	int x=1, y=1;
	lx[1] = ly[1] = tot = 1;
	while(x!=n || y!=m){
		(x<n && f[x+1][y]) ? (x++) : (y++);
		tot++;
		lx[tot] = x; ly[tot] = y;
	}
}
void qry_right(){
	//right_most
	int x=1, y=1;
	rx[1] = ry[1] = tot = 1;
	while(x!=n || y!=m){
		(y<m && f[x][y+1]) ? (y++) : (x++);
		tot++;
		rx[tot] = x; ry[tot] = y;
	}
}
LL qry_sam(int ax[], int ay[], int bx[], int by[]){
	LL ret=0;
	for(int i=1; i<=tot; i++)if(ax[i]==bx[i] && ay[i]==by[i]){
		ret++;
	}
	return ret;
}
void bld(int x, int y){
	//left_most
	int u, v, cur=x+y-1;
	tx[cur]=x; ty[cur]=y;
	// build Left_Up
	u = x; v = y;
	for(int i=cur-1; i>=1; i--){
		(v>1 && g[u][v-1]) ? (v--) : (u--);
		tx[i] = u; ty[i] = v;
	}
	// build Down_Right
	u = x; v = y;
	for(int i=cur+1; i<=tot; i++){
		(u<n && f[u+1][v]) ? (u++) : (v++);
		tx[i] = u; ty[i] = v;
	}
}
void work1(){
	sam = qry_sam(lx, ly, rx, ry);
	ans = sam*(white-1) - sam*(sam-1)/2;
}
void work2(){
	int x,y;
	for(int i=1; i<=tot; i++)if(lx[i]!=rx[i] || ly[i]!=ry[i]){
		x = lx[i]-1; y = ly[i]+1;
		while(!f[x][y] || !g[x][y]){
			x--;
			y++;
		}
		bld(x, y);
		ans += qry_sam(tx, ty, rx, ry)-sam;
//		cerr<<i<<" "<<ans<<"\n";
	}
}
int main(){
	pre();
	if(!f[1][1]){
		printf("%lld\n", white*(white-1)/2);
		return 0;
	}
	qry_left();
	qry_right();
	work1();
	work2();
	printf("%lld", ans);
	return 0;
}