#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<int, int>;
 
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
 
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
 
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
 
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
  for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
 
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const int MOD = 1000000007;

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll h, w;
  cin >> h >> w;
  vector<string> s(h);
  REP(i, h) cin >> s[i];

  vector<string> t(h+w, string(h+w, '.'));
  REP(i, h) REP(j, w) {
    t[j+i][j-i+h-1] = s[i][j];
  }

  REP(i, h+w) cout << t[i] << endl;

  ll n = h+w;
  auto cnt1 = make_v<ll>(n, n);
  REP(i, n) {
    if(t[i][0] == '#') cnt1[i][0] = 1;
    FOR(j, 1, n) {
      cnt1[i][j] += cnt1[i][j-1] + (t[i][j]=='#'?1:0);
    }
  }
  auto cnt2 = make_v<ll>(n, n);
  REP(i, n) {
    if(t[0][i] == '#') cnt2[0][i] = 1;
    FOR(j, 1, n) {
      cnt2[j][i] += cnt2[j-1][i] + (t[j][i]=='#'?1:0);
    }
  }

  ll ret = 0;
  REP(i, n) {
    REP(l, n) {
      if(t[i][l] == '.') continue;
      FOR(r, l+1, n) {
        if(t[i][r] == '.') continue;
        if(i-(r-l) >= 0) {
          ret += cnt1[i-(r-l)][r] - (l==0?0:cnt1[i-(r-l)][l-1]);
        }
        if(i+(r-l) < n) {
          ret += cnt1[i+r-l][r] - (l==0?0:cnt1[i+r-l][l-1]);
        }
      }
    }
  }
  REP(i, n) {
    REP(l, n) {
      if(t[l][i] == '.') continue;
      FOR(r, l+1, n) {
        if(t[r][i] == '.') continue;
        if(i-(r-l) >= 0) {
          ret += cnt2[r-1][i-(r-l)] - (l==0?0:cnt2[l][i-(r-l)]);
        }
        if(i+(r-l) < n) {
          ret += cnt2[r-1][i+r-l] - (l==0?0:cnt2[l][i+r-l]);
        }
      }
    }
  }

  cout << ret << endl;

  return 0;
}
