#include <bits/stdc++.h>
using namespace std;
const int MAX_VALUE = 1e9 + 7;
int horizontal[1111][1111];
int vertical[1111][1111];
int main() {
  int n = 0;
  int m = 0;
  cin >> n >> m;
  vector<string> v(n);
  scanf("");
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    for (int j = 0; j < m; ++j) {
      if (v[i][j] == '*') {
        if (j == 0) {
          horizontal[i][j] = 1;
        } else {
          horizontal[i][j] = horizontal[i][j - 1] + 1;
        }
        if (i == 0) {
          vertical[i][j] = 1;
        } else {
          vertical[i][j] = vertical[i - 1][j] + 1;
        }
      } else {
        if (j != 0) {
          horizontal[i][j] = horizontal[i][j - 1];
        }
        if (i != 0) {
          vertical[i][j] = vertical[i - 1][j];
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (v[i][j] == '*') {
        int up = 0;
        int left = 0;
        int right = 0;
        int down = 0;
        if (i != 0) {
          up = vertical[i - 1][j];
        }
        if (j != 0) {
          left = horizontal[i][j - 1];
        }
        right = horizontal[i][m - 1] - horizontal[i][j];
        down = vertical[n - 1][j] - vertical[i][j];
        ans += 1LL * up * left;
        ans += 1LL * up * right;
        ans += 1LL * down * left;
        ans += 1LL * down * right;
      }
    }
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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;
const int MAX_VALUE = 1e9 + 7;
int horizontal[1111][1111];
int vertical[1111][1111];
int main() {
  int n = 0;
  int m = 0;
  cin >> n >> m;
  vector<string> v(n);
  scanf("");
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    for (int j = 0; j < m; ++j) {
      if (v[i][j] == '*') {
        if (j == 0) {
          horizontal[i][j] = 1;
        } else {
          horizontal[i][j] = horizontal[i][j - 1] + 1;
        }
        if (i == 0) {
          vertical[i][j] = 1;
        } else {
          vertical[i][j] = vertical[i - 1][j] + 1;
        }
      } else {
        if (j != 0) {
          horizontal[i][j] = horizontal[i][j - 1];
        }
        if (i != 0) {
          vertical[i][j] = vertical[i - 1][j];
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (v[i][j] == '*') {
        int up = 0;
        int left = 0;
        int right = 0;
        int down = 0;
        if (i != 0) {
          up = vertical[i - 1][j];
        }
        if (j != 0) {
          left = horizontal[i][j - 1];
        }
        right = horizontal[i][m - 1] - horizontal[i][j];
        down = vertical[n - 1][j] - vertical[i][j];
        ans += 1LL * up * left;
        ans += 1LL * up * right;
        ans += 1LL * down * left;
        ans += 1LL * down * right;
      }
    }
  }
  cout << ans << endl;
  return 0;
}

```