#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
    int H,W; cin >> H >> W;
    vector<string> S(H+1);
    for(int i = 0; i <= W; ++i) S[0].push_back('.');
    for(int i = 1; i <= H; ++i) cin >> S[i];
    for(int i = 1; i <= H; ++i) S[i] = "." + S[i];
    vector<vector<ll>> sum45(H+W+1,vector<ll>(W+1,0)),sum135(H+W+1,vector<ll>(W+1,0));
    for(int i = 0; i <= H; ++i){
        for(int j = 0; j <= W; ++j){
            sum45[i+j][j] = (S[i][j]=='#');
            sum135[i+W-j][j] = (S[i][j]=='#');
        }
    }
    for(int i = 0; i <= W+H; ++i) {
        for(int j = 1; j <= W; ++j) sum45[i][j] += sum45[i][j-1];
        for(int j = 1; j <= W; ++j) sum135[i][j] += sum135[i][j-1];
    }
    int M = max(H,W);
	ll ans = 0;
	for(int i = 1; i <= H; ++i){
		for(int j = 1; j <= W; ++j){
			for(int k = 1; k <= M; ++k) {
				ll sum = 0;
				if(i+k<=H&&S[i+k][j]=='#'&&j+k<=W&&S[i][j+k]=='#'&&0<=i+(j-k)  &&i+(j-k)  <=H+W) sum += sum45[i+j-k][j-1]-sum45[i+j-k][max(j-k,0)];
				if(i+k<=H&&S[i+k][j]=='#'&&0<=j-k&&S[i][j-k]=='#'&&0<=i+W-(j+k)&&i+W-(j+k)<=H+W) sum += sum135[i+W-(j+k)][min(j+k-1,W)]-sum135[i+W-(j+k)][j];
				if(0<=i-k&&S[i-k][j]=='#'&&j+k<=W&&S[i][j+k]=='#'&&0<=i+W-(j-k)&&i+W-(j-k)<=H+W) sum += sum135[i+W-(j-k)][j-1]-sum135[i+W-(j-k)][max(j-k,0)];
				if(0<=i-k&&S[i-k][j]=='#'&&0<=j-k&&S[i][j-k]=='#'&&0<=i+(j+k)  &&i+(j+k)  <=H+W) sum += sum45[i+j+k][min(j+k-1,W)]-sum45[i+j+k][j];
				ll cnt = 0;
				cnt += (0<=i-k&&S[i-k][j]=='#');
				cnt += (0<=j-k&&S[i][j-k]=='#');
				cnt += (i+k<=H&&S[i+k][j]=='#');
				cnt += (j+k<=W&&S[i][j+k]=='#');
				if(cnt == 3) sum += 1;
				if(cnt == 4) sum += 4;
				ans += sum;
			}
		}
	}
	cout << ans << endl;
    
    
    // print();
    // for(int i = 0; i <= H; ++i) print(S[i]);
    // for(int i = 0; i <= W+H; ++i) print(sum45[i]);
    // print();
    // for(int i = 0; i <= W+H; ++i) print(sum135[i]);
}


Measured memory_bytes: 3200