#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;


bitset<300> bs[300],ret;
int cnt[300];
int main(){
    int h,w;
    cin>>h>>w;
    string s[h];
    rep(i,h)cin>>s[i];
    rep(i,h)rep(j,w)bs[i][j]=(s[i][j]=='#');
    ll ans=0;
    rep(i,h)REP(j,i+1,h)REP(k,j+1,h){
        int x=j-i,y=k-j;
        if(x>=y)ret=bs[i]&(bs[j]<<x)&(bs[k]>>(x-y));
        else ret=bs[i]&(bs[j]<<(2*y-x))&(bs[k]<<(y-x));
        ans+=ret.count();
        if(x>=y)ret=bs[i]&(bs[j]>>x)&(bs[k]<<(x-y));
        else ret=bs[i]&(bs[j]>>(2*y-x))&(bs[k]>>(y-x));
        ans+=ret.count();
    }
    rep(i,h){
        rep(j,w)for(int k=2;j+k<w;k+=2){
            if(bs[i][j]&bs[i][j+k]){
                if(i+k/2<h)ans+=bs[i+k/2][j+k/2];
                if(i-k/2>=0)ans+=bs[i-k/2][j+k/2];
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}