//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;  

#define int long long
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
#define lowbit(x) ((x)&(-x))

#define lc(p) ((p)<<1)
#define rc(p) ((p)<<1|1)

#define sqr(x) ((x)*(x))

// #define mod 1000000007
// #define mod 998244353
#define eps 1e-10

#define debug cout<<__LINE__<<" "<<__FUNCTION__<<"\n";
#define spa putchar(' ')
#define ero putchar('\n')

mt19937 rnd(time(0));

constexpr int N=1e6+10,inf=1e18;

inline int read(){
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
inline void write(int x){
	if(!x)putchar('0');
	if(x<0)x=-x,putchar('-');
	int cnt=0,a[30];
	while(x)a[++cnt]=x%10,x/=10;
	while(cnt--)putchar(a[cnt+1]+'0');
}

int f[3030][3030];
int g[3030][3030];
char s[3030][3030];

vector<int>tmp[N];

int calc(int x){
    return x*(x-1)/2;
}

signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	// ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); 
    int n=read(),m=read();
    for(int i=1;i<=n;i++){
        scanf("%s",s[i]+1);
    }
    int cnt=0;
	for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cnt+=(s[i][j]=='.');
        }
    }
	if(s[n][m]=='*'||s[1][1]=='*'){
        write(calc(cnt));
		return 0;
	}
    // f->zheng g->fan
	f[1][1]=1;
    g[n][m]=1;
	for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(s[i][j]=='.'){
                f[i][j]|=f[i][j-1]|f[i-1][j];
            }
        }
    }
	for(int i=n;i;i--){
        for(int j=m;j;j--){
            if(s[i][j]=='.'){
                g[i][j]|=g[i+1][j]|g[i][j+1];
            }
        }
    }
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			g[i][j]&=f[i][j];
			if(g[i][j]){
                tmp[i+j].push_back(i);
            }
		}
	}
    if(!g[n][m]||!g[1][1]){
		write(calc(cnt));
		return 0;
	}
    int ans=0;
	for(int i=2;i<=n+m;i++){
		if(tmp[i].size()==1){
			ans+=--cnt;
			continue ;
		}
		int res1=tmp[i][1];
        int res2=i-res1;
        int res3=tmp[i][tmp[i].size()-1];
        int res4=i-res3;
		if(res1==res3){
            ans++;
        }
		for(int j=i+1;j<=n+m;j++){
			if(res3<n&&g[res3+1][res4]){
                res3++;
            }
			else{
                res4++;
            }
			if(res2<m&&g[res1][res2+1]){
                res2++;
            }
			else{
                res1++;
            }
			if(res3==res1&&tmp[j].size()>1){
                ans++;
            }
		}
		res1=tmp[i][0];
        res2=i-res1;
        res3=tmp[i][tmp[i].size()-2];
        res4=i-res3;
		for(int j=i+1;j<=n+m;j++){
			if(res3<n&&g[res3+1][res4]){
                res3++;
            }
			else{
                res4++;
            }
			if(res2<m&&g[res1][res2+1]){
                res2++;
            }
			else{
                res1++;
            }
			if(res3==res1&&tmp[j].size()>1){
                ans++;
            }
		}
	}
    write(ans);
	return 0;
}