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=list(map(int,input().split()))
a=[input() for i in range(n)]
b=[-1]*n
c=[-1]*m
for i in range(n):
    for j in range(m):
        if a[i][j]=='*':
            b[i]+=1
            c[j]+=1
d=0
for i in range(n):
    for j in range(m):
        if a[i][j]=='*':
            d+=b[i]*c[j]
print(d)