#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
#define mp make_pair


int main() {
  int h, w;
  cin >> h >> w;
  vii a(601), b(601);
  rep (i, h) {
    rep (j, w) {
      char c;
      cin >> c;
      if (c == '#') {
        int x = i - j, y = i + j;
        x += 300;
        a[y].push_back(x);
        b[x].push_back(y);
      }
    }
  }
  rep (i, a.size()) {
    sort(all(a[i]));
  }
  rep (i, b.size()) {
    sort(all(b[i]));
  }
  ll ans = 0;
  rep (i, a.size()) {
    for (int j = 0; j < a[i].size(); j++) {
      for (int k = j + 1; k < a[i].size(); k++) {
        int y = i;
        int x1 = a[i][j], x2 = a[i][k];
        int d = x2 - x1;
        //DEBUG(y);
        //DEBUG(x1);
        //DEBUG(x2);
        if (i - d >= 0) {
          ans += (ll)(upper_bound(a[i - d].begin(), a[i - d].end(), x2) - lower_bound(all(a[i - d]), x1));
        }
        if (i + d < a.size()) {
          ans += (ll)(upper_bound(a[i + d].begin(), a[i + d].end(), x2) - lower_bound(all(a[i + d]), x1));
        }
      }
    }
  }
  rep (i, b.size()) {
    for (int j = 0; j < b[i].size(); j++) {
      for (int k = j + 1; k < b[i].size(); k++) {
        int y = i;
        int x1 = b[i][j], x2 = b[i][k];
        int d = x2 - x1;
        //DEBUG(y);
        //DEBUG(x1);
        //DEBUG(x2);
        if (i - d >= 0) {
          ans += (ll)(lower_bound(b[i - d].begin(), b[i - d].end(), x2) - upper_bound(all(b[i - d]), x1));
        }
        if (i + d < b.size()) {
          ans += (ll)(lower_bound(b[i + d].begin(), b[i + d].end(), x2) - upper_bound(all(b[i + d]), x1));
        }
      }
    }
  }

  cout << ans << endl;
}


Measured memory_bytes: 1280