//set many funcs template
//Ver.20181228
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int nHr(int a,int b){return nCr(a+b-1,b);}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llnHr(long long a,long long b){return llnCr(a+b-1,b);}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}
int chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
int chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}

void shuffledget(int x[],int n){
    srand(time(0));
    int i,b[524288],p,c;
    for(i=0;i<n;i++){
        b[i]=i;
    }
    for(i=n;i>=1;i--){
        p=rand()%i;
        c=b[i-1];b[i-1]=b[p];b[p]=c;
    }
    for(i=0;i<n;i++){
        scanf("%d",&x[b[i]]);
    }
}

int dx4[4]={1,-1,0,0};
int dy4[4]={0,0,1,-1};
int dx8[8]={-1,-1,-1,0,0,1,1,1};
int dy8[8]={-1,0,1,-1,1,-1,0,1};

int search(int x,int a[],int n){
    int st=0,fi=n-1,te;
    while(st<=fi){
        te=(st+fi)/2;
        if(a[te]<x){st=te+1;}else{fi=te-1;}
    }
    return st;
}

void prarr(int arr[],int n){
  int i;
  for(i=0;i<n;i++){
    if(i){printf(" ");}
    printf("%d",arr[i]);
  }
  printf("\n");
  return;
}

typedef struct{
int val;
int node;
}sd;

int sdsortfnc(const void *a,const void *b){
if(((sd*)a)->val < ((sd*)b)->val){return -1;}
if(((sd*)a)->val > ((sd*)b)->val){return 1;}
return 0;
}

long long h,w;
long long calc(char s[1024][1024]){
    long long rw[1024][1024],t,i,j,k;
    long long sum,st,fi,r=0;

    for(i=0;i<=2046;i++){
      t=0;
      for(j=llmax(0,i-1023);j<=llmin(1023,i);j++){
        if(s[j][i-j]=='#'){
          t++;
        }
        rw[j][i-j]=t;
      }
    }

    for(i=700;i<=(350+h+350+w-2);i++){
      for(j=350;j<350+h;j++){
        if(s[j][i-j]=='.'){continue;}
        for(k=j+1;k<350+h;k++){
          if(s[k][i-k]=='.'){continue;}
          t=2*(k-j);
          sum=i-t;
          st=sum-(i-k);
          fi=j;
          r+=(rw[fi][sum-fi]-rw[st-1][sum-(st-1)]);
          sum=i+t;
          st=k;
          fi=sum-(i-j);
          r+=(rw[fi][sum-fi]-rw[st-1][sum-(st-1)]);
        }
      }
    }

    return r;
}

long long doub(char s[1024][1024]){
    long long i,j,k,r=0,t;
    for(i=350;i<350+h;i++){
        for(j=350;j<350+w;j++){
            if(s[i][j]!='#'){continue;}
            for(k=350;k<350+w;k++){
                t=llzt(j,k);
                if(t==0){continue;}
                if(s[i-t][k]=='#'&&s[i+t][k]=='#'){r++;}
            }
            for(k=350;k<350+h;k++){
                t=llzt(i,k);
                if(t==0){continue;}
                if(s[k][j-t]=='#'&&s[k][j+t]=='#'){r++;}
            }
        }
    }
    return r;
}

void swap(char *a,char *b){
    char c;
    c=(*a);
    (*a)=(*b);
    (*b)=c;
}

int main(void){
    long long i,j,n,m,k,a,b,c,r=0,l,t;
    char s[1024][1024];
    scanf("%lld%lld",&h,&w);
    for(i=0;i<h;i++){
      scanf("%s",&s[350+i][350]);
    }
    for(i=0;i<1024;i++){
      for(j=0;j<1024;j++){
        if(350<=i && i<(350+h) && 350<=j && j<(350+w)){
          continue;
        }
        s[i][j]='.';
      }
    }
    r+=calc(s);
    for(i=0;i<h;i++){
        for(j=0;j<w/2;j++){
            swap(&s[350+i][350+j],&s[350+i][350+(w-1-j)]);
        }
    }
    r+=calc(s);

    r-=doub(s);

    printf("%lld\n",r);
    return 0;
}


Measured memory_bytes: 9344