#include <bits/stdc++.h>
using namespace std;
short colona[1000];
char ch;
int n, m;
long long glo;
vector<short> tochki[1000];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cin >> n >> m;
  for (short i = 0; i < n; ++i) {
    for (short j = 0; j < m; ++j) {
      cin >> ch;
      if (ch == '*') {
        ++glo;
        ++colona[j];
        tochki[i].push_back(j);
      }
    }
  }
  if (glo < 3) {
    cout << "0\n";
    return 0;
  }
  glo = 0;
  for (int i = 0; i < n; ++i) {
    if (tochki[i].size() < 2) continue;
    for (int s = 0; s < tochki[i].size() - 1; ++s) {
      for (int f = s + 1; f < tochki[i].size(); ++f) {
        glo += (colona[tochki[i][s]] + colona[tochki[i][f]] - 2);
      }
    }
  }
  cout << glo << '\n';
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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;
short colona[1000];
char ch;
int n, m;
long long glo;
vector<short> tochki[1000];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cin >> n >> m;
  for (short i = 0; i < n; ++i) {
    for (short j = 0; j < m; ++j) {
      cin >> ch;
      if (ch == '*') {
        ++glo;
        ++colona[j];
        tochki[i].push_back(j);
      }
    }
  }
  if (glo < 3) {
    cout << "0\n";
    return 0;
  }
  glo = 0;
  for (int i = 0; i < n; ++i) {
    if (tochki[i].size() < 2) continue;
    for (int s = 0; s < tochki[i].size() - 1; ++s) {
      for (int f = s + 1; f < tochki[i].size(); ++f) {
        glo += (colona[tochki[i][s]] + colona[tochki[i][f]] - 2);
      }
    }
  }
  cout << glo << '\n';
  return 0;
}

```