#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	
	int h, w; cin >> h >> w;
	vector<string> in(h);
	rep(i, h) cin >> in[i];
	
	vector<string> s(h + w, string(h + w, '.'));
	rep(i, h) rep(j, w) if(in[i][j] == '#'){
		int y = i + j, x = i - j + w;
		s[y][x] = '#';
	}
	//rep(i, s.size()) cerr<<s[i]<<endl;
	int ans = 0;
	rep(it, 4){
		vector<vi> sum(s.size(), vi(s[0].size()));
		rep(i, s.size()){
			rep(j, s[0].size()) {
				if(s[i][j] == '#') sum[i][j] = 1;
				if(j) sum[i][j] += sum[i][j - 1];
				if(s[i][j] != '#') continue;
				
				for(int k = 1; k <= i && j + k < s[0].size(); k++) if(s[i][j + k] == '#'){
					ans += sum[i - k][j + k] - sum[i - k][j];
				}
			}
		}
		vector<string> ns(s[0].size(), string(s.size(), '.'));
		rep(i, s.size()) rep(j, s[0].size()) ns[j][s.size() - i - 1] = s[i][j];
		s = ns;
	}
	cout << ans << endl;
	return 0;
}