#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3010;
char a[N][N];
int b[N][N],c[N][N];
vector<int>e[N+N];
int main() {
    int n,m,cnt=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%s",a[i]+1);
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        b[i][j]=(i==1&&j==1)||b[i-1][j]||b[i][j-1];
        b[i][j]&=(a[i][j]=='.');
        cnt+=a[i][j]=='.';
    }
    for(int i=n;i;i--)for(int j=m;j;j--){
        c[i][j]=(i==n&&j==m)||c[i+1][j]|c[i][j+1];
        c[i][j]&=(a[i][j]=='.');
    }
    if(!c[1][1]||!b[n][m]){
        printf("%lld\n",(ll)cnt*(cnt-1)/2);
        return 0;
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(b[i][j]&&c[i][j]){
        e[i+j].push_back(i);
    }else a[i][j]='*';
    ll ans=0;
    for(int i=2,now=0;i<=n+m;i++)if(e[i].size()==1){
        now++;
        ans+=cnt-now;
    }
    
    for(int i=2;i<=n+m;i++)if(e[i].size()>1){
        int l=e[i][1],r=e[i].back();
        if(l==r)ans++;
        for(int j=i+1;j<=n+m;j++){
            if(a[l][j-l]!='.')l++;
            if(a[r+1][j-r-1]=='.')r++;
            if(l==r&&e[j].size()!=1)ans++;
        }
    }
    for(int i=2;i<=n+m;i++)if(e[i].size()>1){
        int l=e[i][0],r=e[i][e[i].size()-2];
        for(int j=i+1;j<=n+m;j++){
            if(a[l][j-l]!='.')l++;
            if(a[r+1][j-r-1]=='.')r++;
            if(l==r&&e[j].size()!=1)ans++;
        }   
    }
    printf("%lld\n",ans);
    return 0;
}