#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inl inline
#define getchar cin.get
#define push_back emplace_back
const int N=3e3+5;
const int M=2e7+5;
const int mod=998244353;
const int inf=1e9;
const double eps=1e-6;
inl int read(){
    int f=1,x=0;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
    return x*f;
}
template<typename T>
inl void read(T& x){
    x=0;int f=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
    x*=f;
}
template<typename T,typename... Args>
inl void read(T& x,Args&... y){read(x),read(y...);}
int n,m,a[N][N],vis1[N][N],vis2[N][N],cnt;
vector<int>v[N<<1];
signed main(){
    // freopen("1.out","w",stdout);
    // freopen("1.in","r",stdin);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    n=read(),m=read();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char c;cin>>c;
            a[i][j]=c=='.';
        }
    }
    vis1[1][1]=a[1][1];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            vis1[i][j]|=vis1[i-1][j];
            vis1[i][j]|=vis1[i][j-1];
            vis1[i][j]&=a[i][j];
        }
    }
    vis2[n][m]=a[n][m];
    for(int i=n;i;i--){
        for(int j=m;j;j--){
            vis2[i][j]|=vis2[i+1][j];
            vis2[i][j]|=vis2[i][j+1];
            vis2[i][j]&=a[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cnt+=a[i][j];
            a[i][j]=vis1[i][j]&vis2[i][j];
            if(a[i][j])v[i+j].push_back(i);
        }
    }
    if(!vis1[n][m])return cout<<cnt*(cnt-1)/2<<endl,0;
    int num=0,ans=0;
    for(int i=2;i<=n+m;i++)
        if(v[i].size()==1)ans+=cnt-++num;
    for(int i=2;i<=n+m;i++){
        if(v[i].size()==1)continue;
        int l=v[i][v[i].size()-2],r=v[i].front();
        ans+=l==r;
        for(int j=i+1;j<=n+m;j++){
            if(a[l+1][j-l-1])l++;
            if(!a[r][j-r])r++;
            if(l==r&&v[j].size()^1)ans++;
        }
    }
    for(int i=2;i<=n+m;i++){
        if(v[i].size()==1)continue;
        int l=v[i].back(),r=v[i][1];
        for(int j=i+1;j<=n+m;j++){
            if(a[l+1][j-l-1])l++;
            if(!a[r][j-r])r++;
            if(l==r&&v[j].size()^1)ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}
/*
3 3
...
...
...

*/