#include <bits/stdc++.h>
using namespace std;
string arr[1001];
long long col[1001], row[1001];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long coun = 0;
  for (long long i = 0; i < n; i++) {
    long long d = 0;
    for (long long j = 0; j < m; j++) {
      if (arr[i][j] == '*') d++;
    }
    row[i] = d;
  }
  for (long long i = 0; i < m; i++) {
    long long d = 0;
    for (long long j = 0; j < n; j++) {
      if (arr[j][i] == '*') d++;
    }
    col[i] = d;
  }
  long long tot = 0;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (arr[i][j] == '*') tot += (col[j] - 1) * (row[i] - 1);
    }
  }
  cout << tot;
  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;
string arr[1001];
long long col[1001], row[1001];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long coun = 0;
  for (long long i = 0; i < n; i++) {
    long long d = 0;
    for (long long j = 0; j < m; j++) {
      if (arr[i][j] == '*') d++;
    }
    row[i] = d;
  }
  for (long long i = 0; i < m; i++) {
    long long d = 0;
    for (long long j = 0; j < n; j++) {
      if (arr[j][i] == '*') d++;
    }
    col[i] = d;
  }
  long long tot = 0;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (arr[i][j] == '*') tot += (col[j] - 1) * (row[i] - 1);
    }
  }
  cout << tot;
  return 0;
}

```