#include <bits/stdc++.h>
using namespace std;
template <class T>
void chmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, T b) {
  if (a > b) a = b;
}
constexpr long long INF = 1000000000000000000;
constexpr long long mod = 1000000007;
constexpr double eps = 1e-8;
const double pi = acos(-1);
long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long Random(long long mi, long long ma) {
  random_device rnd;
  mt19937 mt(rnd());
  uniform_int_distribution<long long> engine(mi, ma);
  return engine(mt);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool prime(long long a) {
  if (a == 1) return false;
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
long long modpow(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2) return modpow(a, b - 1) * a % mod;
  long long memo = modpow(a, b / 2);
  return memo * memo % mod;
}
vector<long long> kaijo, invkaijo;
void init_fact(long long n) {
  kaijo.resize(n + 1);
  invkaijo.resize(n + 1);
  kaijo[0] = 1;
  for (long long i = 1; i <= n; i++) {
    kaijo[i] = kaijo[i - 1] * i;
    kaijo[i] %= mod;
  }
  for (long long i = 0; i < n + 1; i++) invkaijo[i] = modpow(kaijo[i], mod - 2);
}
long long comb(long long a, long long b) {
  if (a < b) return 0;
  if (a < 0 || b < 0) return 0;
  return kaijo[a] * invkaijo[a - b] % mod * invkaijo[b] % mod;
}
long long inv(long long x) {
  x = modpow(x, mod - 2);
  return x;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long h, w, ans = 0, twice = 0;
  cin >> h >> w;
  char s[310][310];
  set<long long> stx[610], sty[610];
  for (long long i = 0; i < h; i++) {
    for (long long j = 0; j < w; j++) {
      cin >> s[i][j];
      if (s[i][j] == '#') {
        long long x = i + 300, y = j;
        stx[x + y - 300].insert(x - y);
        sty[x - y].insert(x + y - 300);
      }
    }
  }
  for (long long x = 0; x < 600; x++) {
    for (long long y1 : stx[x]) {
      for (long long y2 : stx[x]) {
        if (y1 >= y2) continue;
        long long d = y2 - y1;
        if (x - d >= 0) {
          for (long long y : stx[x - d]) {
            if (y1 < y && y < y2)
              ans++;
            else if (y1 == y || y2 == y) {
              ans++;
              twice++;
            }
          }
        }
        if (x + d < 600) {
          for (long long y : stx[x + d]) {
            if (y1 < y && y < y2)
              ans++;
            else if (y1 == y || y2 == y) {
              ans++;
              twice++;
            }
          }
        }
      }
    }
  }
  for (long long y = 0; y < 600; y++) {
    for (long long x1 : sty[y]) {
      for (long long x2 : sty[y]) {
        if (x1 >= x2) continue;
        long long d = x2 - x1;
        if (y - d >= 0) {
          for (long long x : sty[y - d]) {
            if (x1 < x && x < x2)
              ans++;
            else if (x1 == x || x2 == x) {
              ans++;
              twice++;
            }
          }
        }
        if (y + d < 600) {
          for (long long x : sty[y + d]) {
            if (x1 < x && x < x2)
              ans++;
            else if (x1 == x || x2 == x) {
              ans++;
              twice++;
            }
          }
        }
      }
    }
  }
  cout << ans - twice / 2 << endl;
  return 0;
}
