#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int M = 2e6 + 7;
const int lim = 1e6;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1);
const long long xxf = 1e18;
multiset<long long> ms;
priority_queue<int> pq1, pq2;
void blue() { std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int n, m, a[N], b[N];
char s[N];
long long ans;
bool vis[1007][1007];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s + 1);
    for (int j = 1; j <= m; j++) {
      if (s[j] == '*') a[i]++, b[j]++, vis[i][j] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (vis[i][j]) ans = ans + 1ll * (a[i] - 1) * (b[j] - 1);
    }
  }
  printf("%lld\n", ans);
  return 0;
}

### Prompt

In Cpp, your task is to solve 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 N = 2e5 + 7;
const int M = 2e6 + 7;
const int lim = 1e6;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1);
const long long xxf = 1e18;
multiset<long long> ms;
priority_queue<int> pq1, pq2;
void blue() { std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int n, m, a[N], b[N];
char s[N];
long long ans;
bool vis[1007][1007];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s + 1);
    for (int j = 1; j <= m; j++) {
      if (s[j] == '*') a[i]++, b[j]++, vis[i][j] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (vis[i][j]) ans = ans + 1ll * (a[i] - 1) * (b[j] - 1);
    }
  }
  printf("%lld\n", ans);
  return 0;
}

```