#include <bits/stdc++.h>
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)

using namespace std;
using LL = long long;

const int N = 3510;
char a[N][N];
bool fr[N][N], to[N][N], vD[N][N], vR[N][N], c[N][N];

template<class T = int> T read() {
    T x = 0, y = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') {
            y = -1;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * y;
}

int main() {
    int n = read(), m = read(), cnt = 0;
    if (n == 1 && m == 1) {
        puts("0");
        return 0;
    }
    L(i, 1, n) {
        scanf("%s", a[i] + 1);
    }
    L(i, 1, n) {
        L(j, 1, m) {
            cnt += a[i][j] == '.';
        }
    }
    L(i, 1, n) {
        L(j, 1, m) {
            fr[i][j] |= fr[i - 1][j] || fr[i][j - 1] || (i == 1 && j == 1);
            fr[i][j] &= a[i][j] == '.';
        }
    }
    if (!fr[n][m]) {
        printf("%lld\n", (LL)cnt * (cnt - 1) / 2);
        return 0;
    }
    R(i, n, 1) {
        R(j, m, 1) {
            to[i][j] |= to[i + 1][j] || to[i][j + 1] || (i == n && j == m);
            to[i][j] &= a[i][j] == '.';
        }
    }
    int x = 1, y = 1;
    vD[1][1] = true;
    while (true) {
        if (to[x + 1][y]) {
            vD[x + 1][y] = true;
            x++;
        }
        else {
            vD[x][y + 1] = true;
            y++;
        }
        if (x == n && y == m) {
            break;
        }
    }
    x = 1, y = 1;
    vR[1][1] = true;
    while (true) {
        if (to[x][y + 1]) {
            vR[x][y + 1] = true;
            y++;
        }
        else {
            vR[x + 1][y] = true;
            x++;
        }
        if (x == n && y == m) {
            break;
        }
    }
    int cur = 0;
    LL res = 0;
    L(i, 1, n) {
        L(j, 1, m) {
            if (vD[i][j] && vR[i][j]) {
               res += cnt - (++cur); 
            }
        }
    }
    // L(i, 1, n) L(j, 1, m) clog << vD[i][j] << " \n"[j == m];
    // L(i, 1, n) L(j, 1, m) clog << vR[i][j] << " \n"[j == m];
    L(i, 1, n) {
        L(j, 1, m) {
            if (vD[i][j] && !vR[i][j]) {
                int k = 1;
                while (!to[i - k][j + k]) {
                    k++;
                }
                int x = i - k, y = j + k;
                while (true) {
                    if (fr[x][y - 1]) {
                        res += vR[x][y - 1] && !vD[x][y - 1];
                        y--;
                    }
                    else {
                        res += vR[x - 1][y] && !vD[x - 1][y];
                        x--;
                    }
                    if (x == 1 && y == 1) {
                        break;
                    }
                }
                x = i - k, y = j + k;
                while (true) {
                    if (to[x + 1][y]) {
                        res += vR[x + 1][y] && !vD[x + 1][y];
                        x++;
                    }
                    else {
                        res += vR[x][y + 1] && !vD[x][y + 1];
                        y++;
                    }
                    if (x == n && y == m) {
                        break;
                    }
                }
                res += vR[i - k][j + k] && !vD[i - k][j + k];
            }
        }
    }
    printf("%lld\n", res);
    return 0;
}