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())
ma = []
for i in range(n):
    ma.append(input())
x = [0] * n
y = [0] * m
for i in range(n):
    for j in range(m):
        if ma[i][j] == "*":
            x[i] += 1
            y[j] += 1
ans = 0
for i in range(n):
    for j in range(m):
        if ma[i][j] == "*":
            ans += (x[i] - 1) * (y[j] - 1)
print(ans)
