#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=3010,INF=1e9;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
int n,m,cnt,vis[N][N],tot;//cnt空地,tot交点
char c[N][N];
bool vis1[N][N],vis2[N][N];
ll ans;
void dfs1(int i,int j)
{
    if(vis1[i][j]) return;
    vis1[i][j]=true;
    if(i<n && c[i+1][j]=='.') dfs1(i+1,j);
    if(j<m && c[i][j+1]=='.') dfs1(i,j+1);
}
void dfs2(int i,int j)
{
    if(vis2[i][j]) return;
    vis2[i][j]=true;
    if(i>1 && c[i-1][j]=='.') dfs2(i-1,j);
    if(j>1 && c[i][j-1]=='.') dfs2(i,j-1);
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++) cin>>c[i][j];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++) cnt+=(c[i][j]=='.');
    if(c[1][1]=='.') dfs1(1,1);
    if(vis1[n][m]==false)
    {
        cout<<1ll*cnt*(cnt-1)/2;
        return 0;
    }
    dfs2(n,m);
    int x=1,y=1;
    while(x<n | y<m)
    {
        vis[x][y]=1;
        if(y<m && vis2[x][y+1]) y++;
        else x++;
    }
    x=1,y=1;
    while(x<n | y<m)
    {
        if(vis[x][y]==1) vis[x][y]=-1,tot++;
        if(x<n && vis2[x+1][y]) x++;
        else y++;
    }
    x=1,y=1,++tot;
    while(x<n || y<m)
    {
        if(vis[x][y]==0)
        {
            for(int i=x-1,j=y+1;i>=1 && j<=m;i--,j++)
            {
                if(vis1[i][j]==false || vis2[i][j]==false) continue;
                if(vis[i][j]==1) ans++;
                int p=i,q=j;
                while(p>1 || q>1)
                {
                    if(q>1 && vis2[p][q-1]) q--;
                    else p--;
                    if(vis[p][q]==1) ans++;
                }
                p=i,q=j;
                while(p<n || q<m)
                {
                    if(p<n && vis2[p+1][q]) p++;
                    else q++;
                    if(vis[p][q]==1) ans++;
                }
                break;
            }
        }
        if(x<n && vis2[x+1][y]) x++;
        else y++;
    }
    cout<<ans+1ll*tot*(cnt-1)-1ll*tot*(tot-1)/2;
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}