#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
char c[3005][3005];
bool dp[3005][3005];
bool dp2[3005][3005];
vector<int> v[6005];
ll cnt = 0, ans = 0;
int main()
{
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> c[i][j];
            dp[i][j] |= dp[i - 1][j];
            dp[i][j] |= dp[i][j - 1];
            dp[i][j] |= (i == 1 && j == 1);
            dp[i][j] &= (c[i][j] == '.');
            cnt += (c[i][j] == '.');
        }
    }
    for (int i = n; i >= 1; i--)
    {
        for (int j = m; j >= 1; j--)
        {
            dp2[i][j] |= dp2[i + 1][j];
            dp2[i][j] |= dp2[i][j + 1];
            dp2[i][j] |= (i == n && j == m);
            dp2[i][j] &= (c[i][j] == '.');
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (!dp[i][j] || !dp2[i][j])
                c[i][j] = '*';
            else
                v[i + j].push_back(i);
        }
    }
    if (!dp[n][m])
        return cout << cnt * (cnt - 1) / 2 << '\n', 0;
    ll bh = 0;
    for (int i = 2; i <= n + m; i++)
    {
        if (v[i].size() == 1)
            ans += (cnt - (++bh));
    }
    for (int i = 2; i <= n + m; i++) // 堵住最右边的
    {
        if (v[i].size() == 1)
            continue;
        int l = v[i][1], r = v[i].back();
        if (l == r)
            ans++;
        for (int j = i + 1; j <= n + m; j++)
        {
            if (c[l][j - l] == '*') l++;
            if (c[r + 1][j - r - 1] == '.') 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][0], r = v[i][v[i].size() - 2];
        for (int j = i + 1; j <= n + m; j++)
        {
            if (c[l][j - l] != '.')
                l++;
            if (c[r + 1][j - r - 1] == '.')
                r++;
            if (l == r && v[j].size() != 1)
                ans++;
        }
    }
    cout << ans << '\n';
    return 0; 
}