#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
int n, m, a[3010][3010], vse[3010][3010], vnw[3010][3010], cntf;
LL ans = 0;
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    static char buf[3010];
    cin >> buf;
    for (int j = 1; j <= m; j++) a[i][j] = buf[j - 1] == '*', cntf += !a[i][j];
  }
  queue<pair<int, int>> q;
  if (!a[1][1]) vse[1][1] = true, q.emplace(1, 1);
  while (!q.empty()) {
    int x = q.front().first, y = q.front().second; q.pop();
    if (x < n && !a[x + 1][y] && !vse[x + 1][y]) vse[x + 1][y] = true, q.emplace(x + 1, y);
    if (y < m && !a[x][y + 1] && !vse[x][y + 1]) vse[x][y + 1] = true, q.emplace(x, y + 1);
  }
  if (!a[n][m]) vnw[n][m] = true, q.emplace(n, m);
  while (!q.empty()) {
    int x = q.front().first, y = q.front().second; q.pop();
    if (x > 1 && !a[x - 1][y] && !vnw[x - 1][y]) vnw[x - 1][y] = true, q.emplace(x - 1, y);
    if (y > 1 && !a[x][y - 1] && !vnw[x][y - 1]) vnw[x][y - 1] = true, q.emplace(x, y - 1);
  }
  if (!vse[n][m]) return cout << 1ll * (cntf - 1) * cntf / 2 << endl, 0;
  vector<pair<int, int>> Lp, Rp;
  for (int x = 1, y = 1; x + y <= n + m; vnw[x + 1][y] ? ++x : ++y) Lp.emplace_back(x, y);
  for (int x = 1, y = 1; x + y <= n + m; vnw[x][y + 1] ? ++y : ++x) Rp.emplace_back(x, y);
#ifdef LOCALx
  debug("LP: ");
  for (int i = 0; i < n + m - 1; i++) debug("(%d, %d) ->%c", Lp[i].first, Lp[i].second, " \n"[i == n + m - 2]);
  debug("RP: ");
  for (int i = 0; i < n + m - 1; i++) debug("(%d, %d) ->%c", Rp[i].first, Rp[i].second, " \n"[i == n + m - 2]);
#endif
  for (int i = 0; i < n + m - 1; i++) if (Lp[i] == Rp[i]) ans += --cntf, debug("all-kill (%d, %d)\n", Lp[i].first, Lp[i].second);
  for (int i = 0; i < n + m - 1; i++) if (Lp[i] != Rp[i]) {
#ifdef LOCALx
    debug("block Lp[%d] = (%d, %d)\n", i, Lp[i].first, Lp[i].second);
#endif
    int x, y; tie(x, y) = Lp[i];
    vector<pair<int, int>> L2(n + m - 1);
    --x, ++y;
    while (!vse[x][y] || !vnw[x][y]) --x, ++y;
    assert(x >= 1 && y <= m);
    for (int j = i, nx = x, ny = y; j >= 0; j--, vse[nx][ny - 1] ? --ny : --nx) L2[j] = make_pair(nx, ny);
    for (int j = i, nx = x, ny = y; j < n + m - 1; j++, vnw[nx + 1][ny] ? ++nx : ++ny) L2[j] = make_pair(nx, ny);
#ifdef LOCALx
  debug("L2: ");
  for (int i = 0; i < n + m - 1; i++) debug("(%d, %d) ->%c", L2[i].first, L2[i].second, " \n"[i == n + m - 2]);
  debug("RP: ");
  for (int i = 0; i < n + m - 1; i++) debug("(%d, %d) ->%c", Rp[i].first, Rp[i].second, " \n"[i == n + m - 2]);
#endif
    for (int j = 0; j < n + m - 1; j++) if (Lp[j] != Rp[j] && L2[j] == Rp[j]) {
      ans += 1;
#ifdef LOCAL
      auto lhs = Lp[i], rhs = L2[j];
      if (lhs > rhs) swap(lhs, rhs);
      debug("couple (%d, %d) & (%d, %d)\n", lhs.first, lhs.second, rhs.first, rhs.second);
#endif
    }
  }
  cout << ans << endl;
  return 0;
}