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.
n, m =map(int, input().split())
y = m*[0]
x = []
c = []
for i in range(n):
    s = input()
    x.append(s.count('*'))
    for j in range(m):
        if s[j] == '*':
            y[j] += 1
    c.append(s)
z = 0
for x1 in range(len(c)):
    for y1 in range(len(c[x1])):
        if c[x1][y1] == '*':
            z += (y[y1]-1) * (x[x1]-1)
print(z)