#include <bits/stdc++.h>
using namespace std;
int main() {
  long long height, width, ans = 0;
  cin >> height >> width;
  int column[width], row[height];
  for (int k = 0; k < width; k++) {
    column[k] = 0;
  }
  for (int p = 0; p < height; p++) {
    row[p] = 0;
  }
  char carray[height][width];
  for (int x = 0; x < height; x++) {
    for (int y = 0; y < width; y++) {
      cin >> carray[x][y];
      if (carray[x][y] == '*') {
        row[x]++;
        column[y]++;
      }
    }
  }
  for (int z = 0; z < height; z++) {
    for (int w = 0; w < width; w++) {
      if (carray[z][w] == '*') {
        ans += (row[z] - 1) * (column[w] - 1);
      }
    }
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Create a solution in cpp for 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 main() {
  long long height, width, ans = 0;
  cin >> height >> width;
  int column[width], row[height];
  for (int k = 0; k < width; k++) {
    column[k] = 0;
  }
  for (int p = 0; p < height; p++) {
    row[p] = 0;
  }
  char carray[height][width];
  for (int x = 0; x < height; x++) {
    for (int y = 0; y < width; y++) {
      cin >> carray[x][y];
      if (carray[x][y] == '*') {
        row[x]++;
        column[y]++;
      }
    }
  }
  for (int z = 0; z < height; z++) {
    for (int w = 0; w < width; w++) {
      if (carray[z][w] == '*') {
        ans += (row[z] - 1) * (column[w] - 1);
      }
    }
  }
  cout << ans << endl;
  return 0;
}

```