//author: camypaper
using System;
using System.Linq;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using static System.Math;
using C = System.Int32;
using System.Runtime.CompilerServices;

namespace Program {
    public class Solver {
        Random rnd = new Random(0);
        public void Solve() {
            var h = ri;
            var w = ri;
            //h = 300; w = 300;
            var a = Enumerate(h + w, x => new int[h + w]);


            if (true) {
                var mat = Enumerate(h, x => rs);

                for (int i = 0; i < h; i++)
                    for (int j = 0; j < w; j++)
                        if (mat[i][j] == '#') a[i + j][i - j + w]++;
            }
            else {

                for (int i = 0; i < h; i++)
                    for (int j = 0; j < w; j++) a[i][j] = 1;
            }
            var ans = 0L;
            var area = new AreaSum(a);
            for (int i = 0; i < h + w; i++)
                for (int j = 0; j < h + w; j++) {
                    if (a[i][j] == 0)
                        continue;
                    for (int d = 2; d < h + w; d += 2) {
                        for (int k = -1; k <= 1; k += 2)
                            for (int l = -1; l <= 1; l += 2) {
                                if (i + k * d < 0 || i + k * d >= h + w) continue;
                                if (j + l * d < 0 || j + l * d >= h + w) continue;
                                ans -= a[i + k * d][j] & a[i][j + l * d];
                            }
                    }
                    for (int d = 1; d < h + w; d++) {
                        if (i + d < h + w && a[i + d][j] == 1) {
                            ans += area.Sum(i, j - d, i + d + 1, j - d + 1);
                            ans += area.Sum(i, j + d, i + d + 1, j + d + 1);
                        }
                        if (j + d < h + w && a[i][j + d] == 1) {
                            ans += area.Sum(i - d, j, i - d + 1, j + d + 1);
                            ans += area.Sum(i + d, j, i + d + 1, j + d + 1);
                        }
                    }
                }
            Console.WriteLine(ans);
        }

        const long INF = 1L << 60;
        int ri => sc.Integer();
        long rl => sc.Long();
        double rd => sc.Double();
        string rs => sc.Scan();
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static IEnumerable<int> Rep(int n) => Enumerable.Range(0, n);
        static IEnumerable<int> RRep(int n) => Enumerable.Range(0, n).Reverse();
        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < a.Length; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer : StreamWriter {
        public override IFormatProvider FormatProvider => CultureInfo.InvariantCulture;
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0) {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion

#region AreaSum
public class AreaSum {
    int n, m;
    int[][] s;

    public AreaSum(int[][] a) {
        n = a.Length;
        m = a[0].Length;
        s = new int[n + 1][];
        for (int i = 0; i < n + 1; i++)
            s[i] = new int[m + 1];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                s[i + 1][j + 1] = s[i + 1][j] + s[i][j + 1] - s[i][j] + a[i][j];
    }
    /// <summary>
    /// [t,b),[l,r) で作られる矩形領域の和を求める
    /// </summary>
    public int Sum(int top, int left, int bottom, int right) {
        if (top < 0 || left < 0 || bottom > n || right > m || top >= bottom || left >= right) return 0;
        return s[bottom][right] - s[top][right] - s[bottom][left] + s[top][left];
    }
}
#endregion

Measured memory_bytes: 15316