#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, n, i, j;
  long long int v = 0;
  cin >> m >> n;
  char a[m][n];
  int b[m], c[n];
  for (i = 0; i < m; i++) b[i] = 0;
  for (i = 0; i < n; i++) c[i] = 0;
  for (i = 0; i < m; i++) {
    for (j = 0; j < n; j++) {
      cin >> a[i][j];
      if (a[i][j] == '*') {
        b[i]++;
        c[j]++;
      }
    }
  }
  for (i = 0; i < m; i++) {
    for (j = 0; j < n; j++) {
      if (a[i][j] == '*') v = v + ((b[i] - 1) * (c[j] - 1));
    }
  }
  cout << v;
  return 0;
}

### Prompt

Your task is to create a Cpp solution 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 main() {
  int m, n, i, j;
  long long int v = 0;
  cin >> m >> n;
  char a[m][n];
  int b[m], c[n];
  for (i = 0; i < m; i++) b[i] = 0;
  for (i = 0; i < n; i++) c[i] = 0;
  for (i = 0; i < m; i++) {
    for (j = 0; j < n; j++) {
      cin >> a[i][j];
      if (a[i][j] == '*') {
        b[i]++;
        c[j]++;
      }
    }
  }
  for (i = 0; i < m; i++) {
    for (j = 0; j < n; j++) {
      if (a[i][j] == '*') v = v + ((b[i] - 1) * (c[j] - 1));
    }
  }
  cout << v;
  return 0;
}

```