You are given a *n* × *m* field consisting only of periods ('.') and asterisks ('*'). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of '*'-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle).
The first line contains two positive integer numbers *n* and *m* (1 ≤ *n*, *m* ≤ 1000). The following *n* lines consist of *m* characters each, describing the field. Only '.' and '*' are allowed.

import sys
input = sys.stdin.readline


n, m = map(int, input().split())
g = [input()[:-1] for _ in range(n)]
a = [i.count('*') for i in g]
b = [i.count('*') for i in zip(*g)]
c = 0
for i in range(n):
    for j in range(m):
        if g[i][j] == '*':
            c += (a[i]-1)*(b[j]-1)
print(c)