#include<bits/stdc++.h>
const int maxn = 3e3 + 5, maxp = maxn * 2;
std::vector<int> H[maxp];
char s[maxn][maxn];
bool f[maxn][maxn], g[maxn][maxn];
int main() {
    int n, m; scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
    f[1][1] = 1;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) f[i][j] |= f[i - 1][j] | f[i][j - 1], f[i][j] &= s[i][j] == '.';
    g[n][m] = 1;
    for (int i = n; i; i--) for (int j = m; j; j--) g[i][j] |= g[i + 1][j] | g[i][j + 1], g[i][j] &= s[i][j] == '.';
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) f[i][j] &= g[i][j];
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++)  
        f[i][j] && (H[i + j].push_back(i), 1);
    int cnt = 0;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cnt += s[i][j] == '.';
    if (! f[n][m]) return printf("%lld\n", 1ll * cnt * (cnt - 1) / 2), 0;
    long long ans = 0;
    int p = n + m;
    for (int i = 2; i <= p; i++) H[i].size() == 1 && (ans += --cnt);
    for (int i = 2; i <= p; i++) {
        if (H[i].size() == 1) continue;
        if (H[i].size() == 2) ans++;
        int l = H[i][1], r = H[i].back();
        for (int j = i + 1; j <= p; j++) {
            ! f[l][j - l] && (l++);
            r++, ! f[r][j - r] && (r--);
            l == r && H[j].size() > 1 && (ans++);
        }
        l = H[i][0], r = H[i][H[i].size() - 2];
        for (int j = i + 1; j <= p; j++) {
            ! f[l][j - l] && (l++);
            r++, ! f[r][j - r] && (r--);
            l == r && H[j].size() > 1 && (ans++);
        }
    }
    printf("%lld\n", ans);
    return 0;
}