#include <bits/stdc++.h>
#define eb emplace_back
#define pb pop_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef tuple<int, int, int> tu;
bool Mbe;

const int N = 3e3 + 300;

char tc[N];
int fx[4][2] = { { 0, 1 }, { 1, 0 }, { 0, -1 }, { -1, 0 } };
int n, m, s, cup, c[N][N], ct[N][N], a[N][N], ds[N][N], dt[N][N], vl[N][N], vr[N][N], pos[N << 1];
vector<pi> L, R;

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> (tc + 1);
		for (int j = 1; j <= m; j++)
			a[i][j] = (tc[j] == '.' ? 1 : 0), s += a[i][j];
	}
	ds[1][1] = a[1][1], dt[n][m] = a[n][m];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (i == 1 && j == 1) continue;
			if (!a[i][j]) ds[i][j] = 0;
			else ds[i][j] = ds[i - 1][j] | ds[i][j - 1];
		}
	}
	for (int i = n; i; i--) {
		for (int j = m; j; j--) {
			if (i == n && j == m) continue;
			if (!a[i][j]) dt[i][j] = 0;
			else dt[i][j] = dt[i][j + 1] | dt[i + 1][j];
		}
	}
	if (!ds[n][m]) return cout << 1ll * s * (s - 1) / 2 << '\n', void();
	ll res = 0;
	pi cur = mp(1, 1); L.eb(cur);
	while (cur.fi != n || cur.se != m) {
		auto &[i, j] = cur;
		dt[i + 1][j] ? (i++) : (j++);
		L.eb(cur = mp(i, j));
	}
	cur = mp(1, 1), R.eb(cur);
	while (cur.fi != n || cur.se != m) {
		auto &[i, j] = cur;
		dt[i][j + 1] ? (j++) : (i++);
		R.eb(cur = mp(i, j));
	}
	for (auto [x, y] : L) vl[x][y] = 1;
	for (auto [x, y] : R) vr[x][y] = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (vl[i][j] && vr[i][j]) cup++;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (vl[i][j] && vr[i][j]) res += s - 1;
			else if (a[i][j] && !vl[i][j] && !vr[i][j]) res += cup;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (vl[i][j] && !vr[i][j] && pos[i + j]) 
				c[pos[i + j]][i + j - pos[i + j]]++;
			if (ds[i][j] && dt[i][j]) pos[i + j] = i;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (!c[i][j]) continue;
			cur = mp(i, j), ct[i][j] += c[i][j];
			while (cur.fi != 1 || cur.se != 1) {
				auto &[x, y] = cur; 
				ds[x][y - 1] ? (y--) : (x--);
				ct[x][y] += c[i][j], cur = mp(x, y);
			}
			cur = mp(i, j);
			while (cur.fi != n || cur.se != m) {
				auto &[x, y] = cur;
				dt[x + 1][y] ? (x++) : (y++);
				ct[x][y] += c[i][j], cur = mp(x, y);
			}
		}
	}
	for (auto [x, y] : R) res += ct[x][y];
	memset(c, 0, sizeof(c));
	memset(ct, 0, sizeof(ct));
	memset(pos, 0, sizeof(pos));
	for (int i = n; i; i--) {
		for (int j = m; j; j--) {
			if (!vl[i][j] && vr[i][j] && pos[i + j])
				c[pos[i + j]][i + j - pos[i + j]]++;
			if (ds[i][j] && dt[i][j]) pos[i + j] = i;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (!c[i][j]) continue;
			cur = mp(i, j), ct[i][j] += c[i][j];
			while (cur.fi != 1 || cur.se != 1) {
				auto &[x, y] = cur; 
				ds[x - 1][y] ? (x--) : (y--);
				ct[x][y] += c[i][j], cur = mp(x, y);
			}
			cur = mp(i, j);
			while (cur.fi != n || cur.se != m) {
				auto &[x, y] = cur;
				dt[x][y + 1] ? (y++) : (x++);
				ct[x][y] += c[i][j], cur = mp(x, y);
			}
		}
	}
	for (auto [x, y] : L) res += ct[x][y];
	cout << res / 2 << '\n';
}

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen("1.in", "r", stdin);
		freopen("1.out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}