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