Right Triangles

H - Right Triangles

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 52B

Description

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).

Input

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.

Output

Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Sample Input

Input

2 2
**
*.

Output

1

Input

3 4
*..*
.**.
*.**

Output

9

#include<stdio.h>
#include<string.h> 
int main()
{
	int n,m,i,j,r[1011],c[1011];
	__int64 s,t;
	char a[1011][1011];
	while(~scanf("%d%d",&n,&m))
	{
		s=t=0;
		memset(r,0,sizeof(r));
		memset(c,0,sizeof(c));
		for(i=0;i<n;i++)
	     {
		  scanf("%s",a[i]);
		  for(j=0;j<m;j++)
		  if(a[i][j]=='*')
		  {
  			r[i]++;
  			c[j]++;
  		  }
	     }
	     for(i=0;i<n;i++)
	     {
          s=0;
		for(j=0;j<m;j++)
	     if(a[i][j]=='*')
	     s+=c[j]-1;
	     t+=s*(r[i]-1);
	     }
	     printf("%I64d\n",t);
	     
	     
		
	}
}