#include <bits/stdc++.h>
using namespace std;
int NR, NC;
char grid[1100][1100];
int R[1100];
int C[1100];
long long ans = 0;
int main() {
  cin >> NR >> NC;
  for (int i = 0; i < NR; i++) R[i] = 0;
  for (int i = 0; i < NC; i++) C[i] = 0;
  for (int i = 0; i < NR; i++)
    for (int j = 0; j < NC; j++) {
      cin >> grid[i][j];
      if (grid[i][j] == '*') {
        R[i]++;
        C[j]++;
      }
    }
  for (int i = 0; i < NR; i++)
    for (int j = 0; j < NC; j++) {
      if (grid[i][j] == '*') ans += (R[i] - 1) * (C[j] - 1);
    }
  printf("%I64d\n", ans);
}

### Prompt

Please create a solution in CPP to the following problem:

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

Examples

Input

2 2
**
*.


Output

1


Input

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


Output

9

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int NR, NC;
char grid[1100][1100];
int R[1100];
int C[1100];
long long ans = 0;
int main() {
  cin >> NR >> NC;
  for (int i = 0; i < NR; i++) R[i] = 0;
  for (int i = 0; i < NC; i++) C[i] = 0;
  for (int i = 0; i < NR; i++)
    for (int j = 0; j < NC; j++) {
      cin >> grid[i][j];
      if (grid[i][j] == '*') {
        R[i]++;
        C[j]++;
      }
    }
  for (int i = 0; i < NR; i++)
    for (int j = 0; j < NC; j++) {
      if (grid[i][j] == '*') ans += (R[i] - 1) * (C[j] - 1);
    }
  printf("%I64d\n", ans);
}

```