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

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sgn(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int H, W;
string S[330];
int s[3300][3300], cumA[3300][3300], cumB[3300][3300];
int X = 1000;
signed main() {
    cin >> H >> W;
    rep(i, H) {
        cin >> S[i];
        rep(j, W) { s[i + j + X][i - j + X] = S[i][j] == '#'; }
    }
    rep(i, H + W - 1) {
        for (int j = -W + 1; j < H; j++) {
            cumA[i + X][j + 1 + X] += cumA[i + X][j + X] + s[i + X][j + X];
            cumB[i + 1 + X][j + X] += cumB[i + X][j + X] + s[i + X][j + X];
        }
    }
    int ans = 0;
    rep(i, H + W - 1) {
        for (int j = -W + 1; j < H; j++) {
            for (int k = j + 1; k < H; k++) {
                if (s[i + X][j + X] && s[i + X][k + X]) {
                    ans += cumA[i - (k - j) + X][k + 1 + X] - cumA[i - (k - j) + X][j + X];
                    ans += cumA[i + (k - j) + X][k + 1 + X] - cumA[i + (k - j) + X][j + X];
                }
            }
        }
    }
    for (int i = -W + 1; i < H; i++) {
        rep(j, H + W - 1) {
            for (int k = j + 1; k < H + W - 1; k++) {
                if (s[j + X][i + X] && s[k + X][i + X]) {
                    ans += cumB[k + X][i - (k - j) + X] - cumB[j + 1 + X][i - (k - j) + X];
                    ans += cumB[k + X][i + (k - j) + X] - cumB[j + 1 + X][i + (k - j) + X];
                }
            }
        }
    }
    cout << ans << endl;
}


Measured memory_bytes: 17916