#include <bits/stdc++.h>
using namespace std;
int H, W;
int fid[610][610], cmp[610][610];
int ans;
int CMP(int i, int j) {
  if (j < 0) return 0;
  return cmp[i][j];
}
void unit() {
  memset(cmp, 0, sizeof(cmp));
  for (int i = 0; i < 610; i++)
    for (int j = 0; j < 610; j++) {
      if (j == 0)
        cmp[i][j] = fid[i][j];
      else
        cmp[i][j] = fid[i][j] + cmp[i][j - 1];
    }
  for (int i = 0; i < 610; i++) {
    for (int j = 0; j < 610; j++) {
      for (int k = j + 1; k < 610; k++) {
        if (fid[i][j] && fid[i][k]) {
          int d = k - j;
          if (i + d < 610) ans += 2 * (CMP(i + d, k - 1) - CMP(i + d, j));
          if (i - d >= 0) ans += 2 * (CMP(i - d, k - 1) - CMP(i - d, j));
          if (i + d < 610 && fid[i + d][j]) ans++;
          if (i - d >= 0 && fid[i - d][j]) ans++;
          if (i + d < 610 && fid[i + d][k]) ans++;
          if (i - d >= 0 && fid[i - d][k]) ans++;
        }
      }
    }
  }
  return;
}
int main() {
  cin >> H >> W;
  for (int i = 0; i < H; i++)
    for (int j = 0; j < W; j++) {
      int x = i + j, y = i - j + 300;
      char c;
      cin >> c;
      fid[x][y] = (c == '#');
    }
  unit();
  int cpy[610][610] = {0};
  for (int i = 0; i < 610; i++) {
    for (int j = 0; j < 610; j++) {
      cpy[j][i] = fid[i][j];
    }
  }
  for (int i = 0; i < 610; i++)
    for (int j = 0; j < 610; j++) fid[i][j] = cpy[i][j];
  unit();
  cout << ans / 2 << endl;
  return 0;
}
