#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
constexpr int N = 3000;
int n, m, a[N + 3][N + 3], cnt;
std::vector<std::pair<int, int> > L, R;
std::pair<int, int> nxt[N + 3][N + 3], lst[N + 3][N + 3];
int vis[N + 3][N + 3];
ll ans;
int main() {
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            char ch;
            while((ch = getchar()) <= 32);
            a[i][j] = ch == '.';
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cnt += a[i][j];
        }
    }
    for(int i = n; i >= 1; i--) {
        for(int j = m; j >= 1; j--) {
            if(!a[i][j]) continue;
            if(i == n && j == m) nxt[i][j] = {i, j};
            else if(nxt[i][j + 1].first) nxt[i][j] = {i, j + 1};
            else if(nxt[i + 1][j].first) nxt[i][j] = {i + 1, j};
        }
    }
    if(!nxt[1][1].first) {
        printf("%lld\n", 1ll * cnt * (cnt - 1) / 2);
        return 0;
    }
    R.push_back({1, 1});
    while(R.back().first < n || R.back().second < m) {
        R.push_back(nxt[R.back().first][R.back().second]);
    }
    for(int i = n; i >= 1; i--) {
        for(int j = m; j >= 1; j--) {
            if(!a[i][j]) continue;
            if(i == n && j == m) nxt[i][j] = {i, j};
            else if(nxt[i + 1][j].first) nxt[i][j] = {i + 1, j};
            else if(nxt[i][j + 1].first) nxt[i][j] = {i, j + 1};
        }
    }
    L.push_back({1, 1});
    while(L.back().first < n || L.back().second < m) {
        L.push_back(nxt[L.back().first][L.back().second]);
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(!a[i][j]) continue;
            if(i == 1 && j == 1) lst[i][j] = {i, j};
            else if(lst[i][j - 1].first) lst[i][j] = {i, j - 1};
            else if(lst[i - 1][j].first) lst[i][j] = {i - 1, j};
        }
    }
    for(auto pr : R) {
        vis[pr.first][pr.second] = 1;
    }
    int cntx = 0;
    for(auto pr : L) {
        if(vis[pr.first][pr.second]) {
            ++cntx, vis[pr.first][pr.second] |= 2;
        }
    }
    ans = (cnt - 1 + cnt - cntx) * cntx / 2;
    for(auto pr : L) {
        int X = pr.first, Y = pr.second;
        if(vis[X][Y]) continue;
        int x, y;
        for(x = X - 1, y = Y + 1; x >= 1 && y <= m; x--, y++) {
            if(nxt[x][y].first) break;
        }
        // assert(x >= 1 && y <= m);
        int i, j;
        // int __cnt = 0;
        for(i = x, j = y; i > 1 || j > 1; std::tie(i, j) = lst[i][j]) {
            if(vis[i][j] == 1) ++ans;
            // assert(++__cnt <= 2000);
        }
        for(std::tie(i, j) = nxt[x][y]; i < n || j < m; std::tie(i, j) = nxt[i][j]) {
            if(vis[i][j] == 1) ++ans;
            // assert(++__cnt <= 2000);
        }
    }
    printf("%lld\n", ans);
    return 0;
}