#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair<int,int>pii;

typedef vector<int>vi;

#define rep(i,a,b) for(int i=(a);i<(b);i++)

#define fi first

#define se second

#define de(x) cout<<#x<<"="<<x<<endl;

#define dd(x) cout<<#x<<"="<<x<<" " ;

#define pb(x) push_back(x)

#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)

const int N=5e3+;

char mp[N][N];

int h[N][N];

int area[N][N];

int main()

{

    int n,m;

    cin>>n>>m;

    for(int i=;i<=n;++i)

        scanf("%s",mp[i]+);

    memset(h,,sizeof(h));

    for(int i=;i<=n;++i)

        for(int j=;j<=m;++j)

            if(mp[i][j]==''){

                h[i][j]=h[i-][j]+;

            }

    int ans=;

    for(int i=;i<=n;++i){

        stack<pii>stk;

        int ma=-;

        for(int j=;j<=m+;++j){

            int pos=j;

            while(!stk.empty()&&stk.top().fi>h[i][j]){

cout<<stk.top().fi<<'\n';

                if(stk.top().se<=ma){

                    ans++;

                }

                pos=stk.top().se;

                stk.pop();

            }

            if(!h[i+][j])ma=j;

            if(h[i][j]&& ( stk.empty() || (stk.top().fi<h[i][j]) ) )

                stk.push(pii(h[i][j],pos));

        }

    }

    cout<<ans<<endl;

    return ;

}