#include <bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;


string board[330];

li w, h;
li sum_down[666][666];
li sum_up[666][666];

inline bool get(li y, li x) {
    if (min(x, y) < 0ll || x >= w || y >= h)return false;
    return board[y][x] == '#';
}

inline li calc(PI from, PI to) {
    if (from.S >= w || to.S < 0) {
        return 0;
    }
    li index = from.F + from.S;
    if (index < 0 || index >= w + h - 1) {
        return 0;
    }
    li i_from = max(0ll, from.S);
    li i_to = min(w - 1, to.S);
    if (i_from > i_to)return 0;
    return sum_up[index][i_to + 1] - sum_up[index][i_from];
}

inline li calc2(PI from, PI to) {
    if (from.S >= w || to.S < 0) {
        return 0;
    }
    li index = from.F - from.S + w - 1;
    if (index < 0 || index >= w + h - 1) {
        return 0;
    }
    li i_from = max(0ll, from.S);
    li i_to = min(w - 1, to.S);
    if (i_from > i_to)return 0;
    return sum_down[index][i_to + 1] - sum_down[index][i_from];
}

int main() {
    cin >> h >> w;
    rep(i, h) {
        cin >> board[i];
    }

    rep(i, h + w - 1) {
        sum_down[i][0] = 0;
        li start_x = 0;
        li start_y = i - w + 1;
        rep(j, w) {
            sum_down[i][j + 1] = sum_down[i][j] + get(start_y + j, start_x + j);
        }

        sum_up[i][0] = 0;
        start_x = 0;
        start_y = i;
        rep(j, w) {
            sum_up[i][j + 1] = sum_up[i][j] + get(start_y - j, start_x + j);
        }
    }

    li res = 0;
    rep(i, h) {
        rep(j, w) {
            if (!get(i, j))continue;
            repp(k, 1, h) {
                if (i + k >= h)break;
                if (get(i + k, j - k)) {
                    // migi agari
                    PI from = {i, j - k * 2};
                    PI to = {i - k, j - k};
                    res += calc(from, to);

                    from = {i + k * 2, j};
                    to = {i + k, j + k};
                    res += calc(from, to);
                }
                if (get(i + k, j + k)) {
                    //migi sagari
                    PI from = {i + k + 1, j - k + 1};
                    PI to = {i + k * 2 - 1, j - 1};
                    res += calc2(from, to);

                    from = {i - k + 1, j + k + 1};
                    to = {i - 1, j + k * 2 - 1};
                    res += calc2(from, to);
                }
            }
        }
    }
    cout << res << endl;


    return 0;
}

Measured memory_bytes: 7040