#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
 
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr<< #x <<": "<<x<<"\n"
#define debug2(x,y) std::cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<"\n"
 
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int> > vvi;
typedef std::vector<ll> vll;
typedef std::vector<std::vector<ll> > vvll;
typedef std::deque<bool> db;
template<class T> using vv=std::vector<std::vector< T > >;

// cout vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
  int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T> >& vv) {
  int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
  int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<std::deque<T> >& vv) {
  int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout set<cout-able>
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& v) {
  s<<"\n";for(auto elm : v){s<<elm<<"\t";}s<<"\n";return s; }

inline void scan(int&a){scanf("%d",&a);}
inline void scan(int&a,int&b){scanf("%d%d",&a,&b);}
inline void scan(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void scan(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void scan(std::vector<int>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<int> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void scan(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void scan(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void scan(std::vector<ll>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<ll> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(std::vector<char>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<char> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}

inline void print(int a){printf("%d\n",a);}
inline void print(int a,int b){printf("%d %d\n",a,b);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(ll a,ll b){printf("%lld %lld\n",a,b);}
inline void print(std::string s){std::cout << s << "\n";}
inline void print_yn(bool flg){if(flg){printf("Yes\n");}else{printf("No\n");}}

using namespace std;

int main() {
  int h, w;
  scan(h, w);
  vector<vi> plus(600);
  vector<vi> minus(600);
  rep (i, h) {
    rep (j, w) {
      char c;
      scan(c);
      if (c == '#') {
        plus[i+j].push_back(i);
        minus[i-j + 299].push_back(i);
      }
    }
  }
  int ans = 0;
  rep (i, 600) {
    int sz = plus[i].size();
    if (sz < 2) {
      continue;
    }
    rep (j, sz) {
      FOR (k, j+1, sz) {
        int y0 = plus[i][j];
        int y1 = plus[i][k];
        int md = 2*(y1 - y0);
        int targ = i - md;
        if (targ >= 0) {
          int add = lower_bound(all(plus[targ]), y1 - md/2 + 1) - lower_bound(all(plus[targ]), y0 - md/2);
          add = max(add, 0);
          //if (add > 0) { debug2(plus[i][j][0], plus[i][j][1]);debug2(plus[i][k][0], plus[i][k][1]); }
          ans += add;
        }
        targ = i + md;
        if (targ < 600) {
          int add = lower_bound(all(plus[targ]), y1 + md/2 + 1) - lower_bound(all(plus[targ]), y0 + md/2);
          add = max(add, 0);
          //if (add > 0) { debug2(plus[i][j][0], plus[i][j][1]);debug2(plus[i][k][0], plus[i][k][1]); }
          ans += add;
        }
      }
    }
  }

  rep (i, 600) {
    int sz = minus[i].size();
    if (sz < 2) {
      continue;
    }
    rep (j, sz) {
      FOR (k, j+1, sz) {
        int y0 = minus[i][j];
        int y1 = minus[i][k];
        int md = 2*(y1 - y0);
        int targ = i - md;
        if (targ >= 0) {
          int add = lower_bound(all(minus[targ]), y1 - md/2) - lower_bound(all(minus[targ]), y0 - md/2 + 1);
          add = max(add, 0);
          //if (add > 0) { debug2(minus[i][j][0], minus[i][j][1]);debug2(minus[i][k][0], minus[i][k][1]); }
          ans += add;
        }
        targ = i + md;
        if (targ < 600) {
          int add = lower_bound(all(minus[targ]), y1 + md/2) - lower_bound(all(minus[targ]), y0 + md/2 + 1);
          add = max(add, 0);
          //if (add > 0) { debug2(minus[i][j][0], minus[i][j][1]);debug2(minus[i][k][0], minus[i][k][1]); }
          ans += add;
        }
      }
    }
  }
  print(ans);

  return 0;
}


Measured memory_bytes: 1280