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())
lin = []
kol_stroka = [0 for _ in range(n)]
kol_stolb = [0 for _ in range(m)]
for i in range(n):
    lin.append(list(input()))
    k = 0
    for j in range(len(lin[i])):
        if lin[i][j] == '*':
            k += 1
            kol_stolb[j] += 1
    kol_stroka[i] += k
counter = 0
for i in range(n):
    for j in range(m):
        if lin[i][j] == '*':
            counter += (kol_stroka[i] - 1) * (kol_stolb[j] - 1)
print(counter)