#include <bits/stdc++.h>
int n, m;
char s[1011][1011];
int r[1011][1011], c[1011][1011], rs[1011], cs[1011];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s[i]);
    for (int j = m; j > 0; j--) s[i][j] = s[i][j - 1];
    for (int j = 1; j <= m; j++) {
      c[i][j] = c[i - 1][j];
      r[i][j] = r[i][j - 1];
      if (s[i][j] == '*') {
        rs[i]++;
        cs[j]++;
        r[i][j]++;
        c[i][j]++;
      }
    }
  }
  long long int ans = 0LL;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (s[i][j] == '*') {
        int a = r[i][j - 1], b = c[i - 1][j];
        int c = rs[i] - a - 1, d = cs[j] - b - 1;
        ans += 1LL * a * b + 1LL * b * c + 1LL * c * d + 1LL * d * a;
      }
  printf("%I64d\n", ans);
  return 0;
}
