#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define db double
const int maxn = 3e3 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;

namespace IO {
void openfile() {
#ifndef ONLINE_JUDGE
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
}
void Min(int& x, int y) {
    x = (x < y) ? x : y;
}
void Max(int& x, int y) {
    x = (x > y) ? x : y;
}
int add(int x, int y) {
    return (x + y) >= mod ? (x + y - mod) : (x + y);
}
int sub(int x, int y) {
    return (x < y) ? (x + mod - y) : (x - y);
}
void Add(int& x, int y) {
    x = (x + y) >= mod ? (x + y - mod) : (x + y);
}
void Sub(int& x, int y) {
    x = (x < y) ? (x - y + mod) : (x - y);
}
int mul(int x, int y) {
    return 1ll * x * y % mod;
}
void Mul(int& x, int y) {
    x = 1ll * x * y % mod;
}
int qpow(int x, int y = mod - 2) {
    int ans = 1;
    while (y) {
        if (y & 1)
            ans = 1ll * x * ans % mod;
        x = 1ll * x * x % mod, y >>= 1;
    }
    return ans;
}
inline int read() {
    int x = 0, f = 0;
    char c = getchar();
    while (!isdigit(c))
        f |= c == '-', c = getchar();
    while (isdigit(c))
        x = x * 10 + c - '0', c = getchar();
    if (f)
        x = -x;
    return x;
}
}  // namespace IO
using namespace IO;

int n, m, vis[maxn][maxn], vis1[maxn][maxn], vis2[maxn][maxn];
int cnt, tot, ans;
char s[maxn][maxn];

void dfs1(int x, int y) {
    if (vis1[x][y])
        return;
    vis1[x][y] = 1;
    if (x < n && s[x + 1][y] == '.')
        dfs1(x + 1, y);
    if (y < m && s[x][y + 1] == '.')
        dfs1(x, y + 1);
}

void dfs2(int x, int y) {
    if (vis2[x][y])
        return;
    vis2[x][y] = 1;
    if (x > 1 && s[x - 1][y] == '.')
        dfs2(x - 1, y);
    if (y > 1 && s[x][y - 1] == '.')
        dfs2(x, y - 1);
}

signed main() {
    openfile();
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> s[i] + 1;
        for (int j = 1; j <= m; j++)
            cnt += s[i][j] == '.';
    }
    if (s[1][1] == '.')
        dfs1(1, 1);
    if (!vis1[n][m]) {
        cout << 1ll * cnt * (cnt - 1) / 2;
        return 0;
    }
    dfs2(n, m);
    int x = 1, y = 1;
    while (x < n || y < m) {
        vis[x][y] = 1;
        if (y < m && vis2[x][y + 1])
            y++;
        else
            x++;
    }
    x = 1, y = 1;
    while (x < n || y < m) {
        if (vis[x][y] == 1)
            vis[x][y] = -1, tot++;
        if (x < n && vis2[x + 1][y])
            x++;
        else
            y++;
    }
    x = 1, y = 1, ++tot;
    while (x < n || y < m) {
        if (!vis[x][y]) {
            for (int i = x - 1, j = y + 1; i >= 1 && j <= m; i--, j++) {
                if (!vis1[i][j] || !vis2[i][j])
                    continue;
                if (vis[i][j] == 1)
                    ans++;
                int p = i, q = j;
                while (p > 1 || q > 1) {
                    if (q > 1 && vis2[p][q - 1])
                        q--;
                    else
                        p--;
                    if (vis[p][q] == 1)
                        ans++;
                }
                p = i, q = j;
                while (p < n || q < m) {
                    if (p < n && vis2[p + 1][q])
                        p++;
                    else
                        q++;
                    if (vis[p][q] == 1)
                        ans++;
                }
                break;
            }
        }
        if (x < n && vis2[x + 1][y])
            x++;
        else
            y++;
    }
    cout << ans + 1ll * tot * (cnt - 1) - 1ll * tot * (tot - 1) / 2;
    return 0;
}