#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<long long>;
using vii = vector<vi>;
using pii = std::pair<long long, long long>;
long long MOD = 1e9 + 7;
constexpr long long MAX = 1e6;
constexpr long long INF = (1ll << 62);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
struct Segment_tree {
  long long N;
  vector<pii> node;
  Segment_tree(long long sz) {
    N = 1;
    while (N < sz) N *= 2;
    node.resize(2 * N - 1, std::make_pair(INF, INF));
    for (long long i = (long long)(N - 2); (long long)(0) <= i; i--) {
      node[i] = std::min(node[i * 2 + 1], node[i * 2 + 1]);
    }
  }
  void update(long long X, pii val) {
    X += N - 1;
    node[X] = val;
    while (X > 0) {
      X = (X - 1) / 2;
      node[X] = std::min(node[X * 2 + 1], node[X * 2 + 2]);
    }
  }
  pii RMQ(long long a, long long b, long long now, long long l, long long r) {
    if (r < 0) r = N;
    if (r <= a || b <= l) return std::make_pair(INF, INF);
    if (a <= l && r <= b) return node[now];
    auto vl = RMQ(a, b, now * 2 + 1, l, (l + r) / 2),
         vr = RMQ(a, b, now * 2 + 2, (l + r) / 2, r);
    return std::min(vl, vr);
  }
};
struct Binary_indexed_tree {
  int N;
  vi bit;
  Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
  void add(int x, int a) {
    for (x; x <= N; x += (x & -x)) bit[x] += a;
  }
  long long sum(int x) {
    long long ret = 0;
    for (x; x > 0; x -= (x & -x)) ret += bit[x];
    return ret;
  }
  long long lower_bound(long long X) {
    if (sum(N) < X) return -1;
    long long ret = 0, memo = 1, sum = 0;
    while (memo * 2 <= N) memo *= 2;
    while (memo > 0) {
      if (memo + ret <= N && sum + bit[memo + ret] < X) {
        sum += bit[memo + ret];
        ret += memo;
      }
      memo /= 2;
    }
    return ret + 1;
  }
};
struct Union_Find {
  long long N;
  vi par;
  vi siz;
  Union_Find(int n) : N(n) {
    par.resize(N);
    siz.resize(N, 1);
    for (long long i = (long long)(0); i < (long long)(N); i++) par[i] = i;
  }
  long long root(long long X) {
    if (par[X] == X) return X;
    return par[X] = root(par[X]);
  }
  bool same(long long X, long long Y) { return root(X) == root(Y); }
  void unite(long long X, long long Y) {
    X = root(X);
    Y = root(Y);
    if (X == Y) return;
    par[X] = Y;
    siz[Y] += siz[X];
    siz[X] = 0;
  }
  long long size(long long X) { return siz[root(X)]; }
};
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
vi fac, finv, inv;
void COMinit() {
  fac.resize(MAX);
  finv.resize(MAX);
  inv.resize(MAX);
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(long long n, long long r) {
  if (n < r || n < 0 || r < 0) return 0;
  return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
long long H, W;
void make_table(vector<vector<char>> &S, long long X) {
  if ((X & 1) == 1) {
    for (long long i = (long long)(0); i < (long long)(H); i++) {
      reverse((S[i]).begin(), (S[i]).end());
    }
  }
  if ((X & 2) == 2) {
    for (long long j = (long long)(0); j < (long long)(W); j++) {
      for (long long i = (long long)(0); i < (long long)(H / 2); i++) {
        std::swap(S[i][j], S[H - 1 - i][j]);
      }
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cin >> H >> W;
  vector<vector<char>> S(H, vector<char>(W));
  for (long long i = (long long)(0); i < (long long)(H); i++) {
    for (long long j = (long long)(0); j < (long long)(W); j++) cin >> S[i][j];
  }
  long long ans = 0;
  for (long long i = (long long)(0); i < (long long)(4); i++) {
    vector<vii> dp(H + W, vii(H, vi(W)));
    make_table(S, i);
    for (long long j = (long long)(0); j < (long long)(H); j++) {
      for (long long k = (long long)(0); k < (long long)(W); k++) {
        if (S[j][k] == '#') dp[j + k][j][k]++;
      }
    }
    for (long long j = (long long)(0); j < (long long)(H + W); j++) {
      for (long long k = (long long)(0); k < (long long)(H); k++) {
        for (long long l = (long long)(1); l < (long long)(W); l++) {
          dp[j][k][l] += dp[j][k][l - 1];
        }
      }
      for (long long k = (long long)(0); k < (long long)(W); k++) {
        for (long long l = (long long)(1); l < (long long)(H); l++) {
          dp[j][l][k] += dp[j][l - 1][k];
        }
      }
    }
    for (long long j = (long long)(1); j < (long long)(H); j++) {
      for (long long k = (long long)(1); k < (long long)(W); k++) {
        for (long long l = (long long)(1); l <= (long long)(H); l++) {
          if (j + l >= H || k + l >= W || j + k < l) break;
          if (S[j + l][k] == '.' || S[j][k + l] == '.') continue;
          ans += dp[j + k - l][j - 1][k - 1];
        }
      }
    }
    make_table(S, i);
  }
  vi P = {0, 1, 0, -1}, Q = {1, 0, -1, 0};
  for (long long i = (long long)(0); i < (long long)(H); i++) {
    for (long long j = (long long)(0); j < (long long)(W); j++) {
      for (long long k = (long long)(1); k < (long long)(H); k++) {
        long long cnt = 0;
        for (long long l = (long long)(0); l < (long long)(4); l++) {
          long long X = i + P[l] * k, Y = j + Q[l] * k;
          if (0 <= X && X < H && 0 <= Y && Y < W && S[X][Y] == '#') cnt++;
        }
        if (cnt == 3) ans++;
        if (cnt == 4) ans += 4;
      }
    }
  }
  cout << ans << "\n";
}
