#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PII;


// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

PII calc(vector<vector<int>> &field) {
  int N = field.size();
  auto ruiseki = exvector(0, N, N+1);
  for(int i=0; i<N; i++) {
    ruiseki[i][0] = 0;
    for(int j=0; j<N; j++) {
      ruiseki[i][j+1] = ruiseki[i][j] + field[i][j];
    }
  }
  int ans = 0;
  int hosei = 0;
  for(int i=0; i<N; i++) {
    for(int j=0; j<N; j++) {
      if(field[i][j] == 0) continue;
      for(int k=j+2; k<N; k+=2) {
        if(field[i][k] == 0) continue;
        int diff = k-j;
        if(i-diff >= 0) {
          ans += ruiseki[i-diff][k+1] - ruiseki[i-diff][j];
          if(field[i-diff][k] == 1) hosei++;
          if(field[i-diff][j] == 1) hosei++;
        }
        if(i+diff < N) {
          ans += ruiseki[i+diff][k+1] - ruiseki[i+diff][j];
          if(field[i+diff][k] == 1) hosei++;
          if(field[i+diff][j] == 1) hosei++;
        }
      }
    }

  }
  return PII(ans, hosei);

}


int main(){ 
  int H, W;
  cin >> H >> W;
  vector<string> input;

  auto field = exvector(0, H+W, H+W);
  for(int i=0; i<H; i++) {
    string s;
    cin >> s;
    input.push_back(s);
    for(int j=0; j<W; j++) {
      if(s[j]=='#') {
        field[i+j][i-j+W-1] = 1;
      }
    }
  }
  int ans = 0, hosei = 0;
  PII res = calc(field);
  ans += res.first;
  hosei += res.second;
  for(int i=0; i<H+W; i++)
    for(int j=0; j<i; j++)
      swap(field[i][j], field[j][i]);

  res = calc(field);
  ans += res.first;
  hosei += res.second;
  ans -= hosei/2;
  
  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 3328