#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9 + 1;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
long long n, m, i, j, row[1001], col[1001], res;
char a[1001][1001];
void Init() {
  cin >> n >> m;
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= m; ++j) {
      cin >> a[i][j];
      if (a[i][j] == '*') row[i]++, col[j]++;
    }
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= m; ++j)
      if (a[i][j] == '*') res = res + ((row[i] - 1) * (col[j] - 1));
  cout << res;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  Init();
}

### Prompt

Please formulate 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;
const int oo = 1e9 + 1;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
long long n, m, i, j, row[1001], col[1001], res;
char a[1001][1001];
void Init() {
  cin >> n >> m;
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= m; ++j) {
      cin >> a[i][j];
      if (a[i][j] == '*') row[i]++, col[j]++;
    }
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= m; ++j)
      if (a[i][j] == '*') res = res + ((row[i] - 1) * (col[j] - 1));
  cout << res;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  Init();
}

```