#include <bits/stdc++.h>
#define FileIO_(file) \
    freopen (file ".in", "r", stdin); \
    freopen (file ".out", "w", stdout);

using namespace std;

template<typename Tp>
inline void chmin (Tp &x, const Tp &y) { if (y < x) x = y; }
template<typename Tp>
inline void chmax (Tp &x, const Tp &y) { if (x < y) x = y; }

typedef double dbl;
typedef long long ll;
typedef long double ldb;

void init () {}

const int maxnm = 3e3 + 20;
int n, m, len, g[maxnm][maxnm];
ll cnt, num, ans;
bool chpre[maxnm][maxnm], chsuf[maxnm][maxnm];

int getid (int x, int y) {
    return (x - 1) * m + (y - 1);
}

vector<int> findrd (int sx, int sy, int dx, int dy) {
    vector<int> res (1, getid (sx, sy));

    while (getid (sx, sy) != n * m - 1) {
        int flag = !chpre[sx + dx][sy + dy];
        res.emplace_back (getid (
            sx += dx ^ flag, sy += dy ^ flag));
    }

    return res;
}

int check (const vector<int> &lhs, const vector<int> &rhs) {
    int res = 0;
    for (int i = 0; i < len; ++i)
        res += lhs[i] == rhs[i];
    return res;
}

void solve () {
    scanf ("%d%d", &n, &m); len = n + m - 1;

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            while (!isgraph (g[i][j] = getchar ()));
            cnt += g[i][j] = g[i][j] == '.';
        }
    }

    if (!g[1][1] || !g[n][m]) {
        printf ("%lld\n", cnt * (cnt - 1) / 2);
        return;
    }

    chpre[n][m] = chsuf[1][1] = 1;

    for (int i = n; i; --i) {
        for (int j = m; j; --j) {
            if (i != n || j != m)
                chpre[i][j] = g[i][j] &&
                    (chpre[i + 1][j] || chpre[i][j + 1]);
        }
    }

    if (!chpre[1][1]) {
        printf ("%lld\n", cnt * (cnt - 1) / 2);
        return;
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (i != 1 || j != 1)
                chsuf[i][j] = g[i][j] &&
                    (chsuf[i - 1][j] || chsuf[i][j - 1]);
        }
    }

    vector<int> lrd = findrd (1, 1, 1, 0);
    vector<int> rrd = findrd (1, 1, 0, 1);

    num = check (lrd, rrd);
    ans += num * (cnt - 1) - num * (num - 1) / 2;

    for (int i = 0; i < len; ++i) {
        if (lrd[i] == rrd[i]) continue;
        int x = lrd[i] / m + 1, y = lrd[i] % m + 1;
        do --x, ++y; while (!chpre[x][y] || !chsuf[x][y]);
        vector<int> nrd; int nx = x, ny = y;
        while (getid (nx, ny)) {
            int flag = chsuf[nx][ny - 1];
            nrd.emplace_back (getid (
                nx -= !flag, ny -= flag));
        }
        reverse (nrd.begin (), nrd.end ());
        for (int pos : findrd (x, y, 1, 0))
            nrd.emplace_back (pos);
        // for (int pos : nrd)
        //     cerr << pos << " ";
        // cerr << endl;
        ans += check (nrd, rrd) - num;
    }

    printf ("%lld\n", ans);
}

int main () {
//	#ifndef LSY
//	FileIO_("");
//	#endif
    int t = 1; init ();
//	scanf ("%d", &t);
    while (t--) solve ();
    return 0;
}