#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif



#include <cstdio>
#include <iostream>
#include <cmath>
#include <utility>
#include <memory>
#include <memory.h>
#include <cstdlib>
#include <set>
#include <map>
#include <cassert>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <numeric>
#include <algorithm>
#include <complex>
#include <vector>
#include <random>
#include <ctime>
#include <ostream>
#include <queue>
#include <array>


using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using vi = std::vector<int>;
using pii = std::pair<int, int>;
using vvi = std::vector<vi>;
using vii = std::vector<pii>;
using vll = std::vector<ll>;
using pll = std::pair<ll, ll>;

#define MAKE_FINAL_NAME_HELPER(A, B) A ## B
#define MAKE_FINAL_NAME(NAME, NUM) MAKE_FINAL_NAME_HELPER(NAME ## _, NUM)
#define ARGUMENTS_SIZE_HELPER(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, COUNT, ...) COUNT
#define ARGUMENTS_SIZE(...) ARGUMENTS_SIZE_HELPER(__VA_ARGS__, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)
#define SELECT_MACRO(NAME, ...) MAKE_FINAL_NAME(NAME, ARGUMENTS_SIZE(__VA_ARGS__))(__VA_ARGS__)

#define pb push_back
#define sz(c) int((c).size())
#define all(c) begin(c), end(c)
#define mp(x, y) make_pair(x, y)
#define fst first
#define snd second

#define ford(...) SELECT_MACRO(ford, __VA_ARGS__)
#define ford_3(i, s, n) for (int i = int(n) - 1; i >= int(s); --i)
#define ford_2(i, n) ford_3(i, 0, n)

#define forn(...) SELECT_MACRO(forn, __VA_ARGS__)
#define forn_3(i, s, n) for (int i = int(s); i < int(n); ++i)
#define forn_2(i, n) forn_3(i, 0, n)

#define y1 y1___
#define prev prev___
#define next next___
#define hash hash___
#define left left___
#define right right___

template<typename T>
int sign(const T& t) {
    return (t > 0) - (t < 0);
}

template<typename T, typename U>
bool remax(T& a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T, typename U>
bool remin(T& a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
T gcd(T a, T b) {
    a = std::abs(a);
    b = std::abs(b);
    while (b) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}

template<typename T>
T lcm(T a, T b) {
    a = std::abs(a);
    b = std::abs(b);
    return a / gcd(a, b) * b;
}

double get_time() {
    return static_cast<double>(clock()) / CLOCKS_PER_SEC;
}

uint32_t mrand_32t() {
    static std::random_device rd;
    // TODO: seed with 19937 bits, not with 32
    static std::mt19937 rng(rd());
    return rng();
}

uint64_t mrand_64t() {
    static std::random_device rd;
    // TODO: seed with 19937 bits, not with 32
    static std::mt19937_64 rng(rd());
    return rng();
}

template<typename T>
void make_unique(std::vector<T>& v) {
    std::sort(std::begin(v), std::end(v));
    v.erase(std::unique(std::begin(v), std::end(v)), std::end(v));
}

#include <sstream>

namespace std {

template<typename A, typename B>
string to_string(const pair <A, B>& p) {
    string str;
    str += "(";
    str += to_string(p.first);
    str += ", ";
    str += to_string(p.second);
    str += ")";
    return str;
}

string to_string(bool value) {
    return value ? "true" : "false";
}

template<typename T>
string to_string(const vector <T>& vec) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : vec) {
        if (!first) {
            str += ", ";
        }
        str += to_string(it);
        first = false;
    }
    str += " }";
    return str;
}

template<typename T>
string to_string(const set <T>& s) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : s) {
        if (!first) {
            str += ", ";
        }
        str += to_string(it);
        first = false;
    }
    str += " }";
    return str;
}


template<typename K, typename V>
string to_string(const map <K, V>& m) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : m) {
        if (!first) {
            str += ", ";
        }
        first = false;
        str += to_string(it.first);
        str += " -> ";
        str += to_string(it.second);
    }
    str += " }";
    return str;
}

string to_string(const string& s) {
    return "\"" + s + "\"";
}

string to_string(const char* s) {
    return to_string(string(s));
}

string to_string(char ch) {
    return "\'" + string(1, ch) + "\'";
}

template<size_t N>
string to_string(const bitset<N>& b) {
    string res(N, '0');
    for (size_t i = 0; i < N; ++i) {
        res[i] = '0' + b[i];
    }
    return res;
}

template <typename T>
string to_string(const T& t) {
    std::stringstream ss;
    ss << t;
    return ss.str();
}

}

void debug_out() {
    std::cerr << std::endl;
}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    std::cerr << " " << std::to_string(H);
    debug_out(T...);
}

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
    #define debug(...) std::cerr << "[" << #__VA_ARGS__ <<  "]:", debug_out(__VA_ARGS__);
#else
    #define eprintf(...)
    #define cerr if (false) cerr
    #define debug(...)
#endif

using namespace std;

/* *************************** TEMPLATE CODE ENDS HERE ******************************** */

#define image(c) sort(all(c)), c.resize(unique(all(c)) - c.begin())

struct pnt {
    int x, y;

    pnt trans() const {
        return pnt{x + y, x - y};
    }
};

int n;
vector<pnt> ps;

bool read() {
    int h, w;
    if (!(cin >> h >> w)) {
        return 0;
    }
    ps.clear();
    forn(i, h) {
        string s;
        cin >> s;
        assert(sz(s) == w);
        forn(j, w) {
            if (s[j] == '#') {
                ps.pb(pnt{j, i});
            }
        }
    }
    n = sz(ps);
    return 1;
}

int pos_at(const vi& t, const int x) {
    int p = lower_bound(all(t), x) - t.begin();
    return p;
}

const int MAXN = 2 * 300 + 10;

void solve() {
    for (auto& p : ps) {
        p = p.trans();
    }

    ll ans = 0;
    forn(it, 2) {
        vi xs;
        for (const auto& p : ps) {
            xs.pb(p.x);
        }
        image(xs);

        vvi ys(sz(xs));
        for (const auto& p : ps) {
            int px = pos_at(xs, p.x);
            ys[px].pb(p.y);
        }
        for (auto& col : ys) {
            image(col);
        }

        static int mem_lower[MAXN][2 * MAXN];
        memset (mem_lower, -1, sizeof mem_lower);
        const auto lower_bound_y = [&](int px, int y) -> int {
            int& res = mem_lower[px][MAXN + y];
            if (res != -1) {
                return res;
            }
            return (res = (lower_bound(all(ys[px]), y) - ys[px].begin()));
        };

        static int mem_upper[MAXN][2 * MAXN];
        memset (mem_upper, -1, sizeof mem_upper);
        const auto upper_bound_y = [&](int px, int y) -> int {
            int& res = mem_upper[px][MAXN + y];
            if (res != -1) {
                return res;
            }
            return (res = (upper_bound(all(ys[px]), y) - ys[px].begin()));
        };

        static int mem_xs[2 * MAXN];
        memset (mem_xs, -1, sizeof mem_xs);
        const auto lower_bound_x = [&](int x) -> int {
            if (x <= -MAXN || x >= MAXN) {
                return -1;
            }
            int& res = mem_xs[MAXN + x];
            if (res != -1) {
                return res;
            }
            return (res = lower_bound(all(xs), x) - xs.begin());
        };

        for (const int x : xs) {
            const int px = lower_bound_x(x);
            forn(i, sz(ys[px])) {
                forn(j, i + 1, sz(ys[px])) {
                    int y1 = ys[px][i];
                    int y2 = ys[px][j];
                    const int dist = y2 - y1;
                    assert(dist > 0);

                    for (int dx = -dist; dx <= dist; dx += 2 * dist) {
                        const int xx = x + dx;
                        const int pxx = lower_bound_x(xx);
                        if (!(0 <= pxx && pxx < sz(xs) && xs[pxx] == xx)) {
                            continue;
                        }

                        int p1;
                        if (it == 0) {
                            p1 = upper_bound_y(pxx, y1);
                        } else {
                            p1 = lower_bound_y(pxx, y1);
                        }

                        int p2;
                        if (it == 0) {
                            p2 = upper_bound_y(pxx, y2 - 1);
                            --p2;
                        } else {
                            p2 = upper_bound_y(pxx, y2);
                            --p2;
                        }

                        ans += max(0, p2 - p1 + 1);


//                        if (0) {
//                            for (int j = p1; j <= p2; ++j) {
//                                eprintf("it = %d, x = %d, y1 = %d, y2 = %d, xx = %d, yy = %d\n", it, x, y1, y2, xx, ys[pxx][j]);
//                            }
//                        }
                    }
                }
            }
        }

        for (auto& p : ps) {
            swap(p.x, p.y);
        }
    }

    cout << ans << endl;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cout.precision(12);
    cout << fixed;

#ifdef LOCAL
    #define FILE_NAME "a"
    assert(freopen(FILE_NAME ".in", "r", stdin));
//    freopen(FILE_NAME ".out", "w", stdout);
#endif

    while (read()) {
        solve();
    }

    return 0;
}


Measured memory_bytes: 7676