#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

bool Mst;

const int maxn = 3030;

int n, m;
bitset<maxn> f[maxn], g[maxn], a[maxn], b[maxn];
char s[maxn][maxn];

const int mod = 11451419;

struct HashTable {
	int hd[mod + 3], len, nxt[maxn * maxn * 4];
	ll val[maxn * maxn * 4];
	
	inline void add(ll x) {
		int u = x % mod;
		for (int i = hd[u]; i; i = nxt[i]) {
			if (val[i] == x) {
				return;
			}
		}
		val[++len] = x;
		nxt[len] = hd[u];
		hd[u] = len;
	}
} mp;

void solve() {
	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) {
			if (s[i][j] == '*') {
				f[i][j] = 0;
			}
			if (f[i][j]) {
				f[i + 1][j] = f[i][j + 1] = 1;
			}
		}
	}
	g[n][m] = 1;
	for (int i = n; i; --i) {
		for (int j = m; j; --j) {
			if (s[i][j] == '*') {
				g[i][j] = 0;
			}
			if (g[i][j]) {
				g[i - 1][j] = g[i][j - 1] = 1;
			}
		}
	}
	if (!f[n][m]) {
		ll cnt = 0;
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				cnt += (s[i][j] == '.');
			}
		}
		printf("%lld\n", cnt * (cnt - 1) / 2);
		return;
	}
	int x = 1, y = 1;
	while (x < n || y < m) {
		a[x][y] = 1;
		if (x < n && f[x + 1][y] && g[x + 1][y]) {
			++x;
		} else {
			++y;
		}
	}
	a[n][m] = b[n][m] = 1;
	x = y = 1;
	while (x < n || y < m) {
		b[x][y] = 1;
		if (y < m && f[x][y + 1] && g[x][y + 1]) {
			++y;
		} else {
			++x;
		}
	}
	ll c1 = 0, c2 = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			c1 += (a[i][j] && b[i][j]);
			c2 += (s[i][j] == '.');
		}
	}
	ll ans = c1 * (c2 - 1) - c1 * (c1 - 1) / 2;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (a[i][j] && !b[i][j]) {
				int x = i, y = j;
				do {
					--x;
					++y;
				} while (!f[x][y] || !g[x][y]);
				if (!a[x][y] && b[x][y]) {
					mp.add(i + 10000LL * j + 100000000LL * x + 1000000000000LL * y);
				}
				int p = x, q = y;
				while (x > 1 || y > 1) {
					if (y > 1 && f[x][y - 1] && g[x][y - 1]) {
						--y;
					} else {
						--x;
					}
					if (!a[x][y] && b[x][y]) {
						mp.add(i + 10000LL * j + 100000000LL * x + 1000000000000LL * y);
					}
				}
				x = p;
				y = q;
				while (x < n || y < m) {
					if (x < n && f[x + 1][y] && g[x + 1][y]) {
						++x;
					} else {
						++y;
					}
					if (!a[x][y] && b[x][y]) {
						mp.add(i + 10000LL * j + 100000000LL * x + 1000000000000LL * y);
					}
				}
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (!a[i][j] && b[i][j]) {
				int x = i, y = j;
				do {
					++x;
					--y;
				} while (!f[x][y] || !g[x][y]);
				if (a[x][y] && !b[x][y]) {
					mp.add(x + 10000LL * y + 100000000LL * i + 1000000000000LL * j);
				}
				int p = x, q = y;
				while (x > 1 || y > 1) {
					if (x > 1 && f[x - 1][y] && g[x - 1][y]) {
						--x;
					} else {
						--y;
					}
					if (a[x][y] && !b[x][y]) {
						mp.add(x + 10000LL * y + 100000000LL * i + 1000000000000LL * j);
					}
				}
				x = p;
				y = q;
				while (x < n || y < m) {
					if (y < m && f[x][y + 1] && g[x][y + 1]) {
						++y;
					} else {
						++x;
					}
					if (a[x][y] && !b[x][y]) {
						mp.add(x + 10000LL * y + 100000000LL * i + 1000000000000LL * j);
					}
				}
			}
		}
	}
	ans += mp.len;
	printf("%lld\n", ans);
}

bool Med;

int main() {
	fprintf(stderr, "%.2lf MB\n", (&Mst - &Med) / 1048576.);
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}