#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1028;
char field[MAXN][MAXN];
int cnt[MAXN][MAXN][4];
int main() {
  for (int n, m; ~scanf("%d%d", &n, &m);) {
    for (int i = 0; i < n; i++) {
      scanf("%s", field[i]);
    }
    memset(cnt, 0, sizeof cnt);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        cnt[i][j][0] = i > 0 ? cnt[i - 1][j][0] + (field[i - 1][j] == '*') : 0;
        cnt[i][j][1] = j > 0 ? cnt[i][j - 1][1] + (field[i][j - 1] == '*') : 0;
      }
    }
    for (int i = n - 1; i >= 0; i--) {
      for (int j = m - 1; j >= 0; j--) {
        cnt[i][j][2] =
            i + 1 < n ? cnt[i + 1][j][2] + (field[i + 1][j] == '*') : 0;
        cnt[i][j][3] =
            j + 1 < m ? cnt[i][j + 1][3] + (field[i][j + 1] == '*') : 0;
      }
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (field[i][j] == '*') {
          for (int k = 0; k < 4; k++) {
            ans += cnt[i][j][k] * cnt[i][j][(k + 1) % 4];
          }
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
