#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
#pragma GCC optimize("O3","unroll-loops")
//#pragma GCC target("popcnt")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll r, c;
char v[2005][2005];
ll dp1[2005][2005], dp2[2005][2005], dp3[2005][2005], dp4[2005][2005];
ll idx[2005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> r >> c;
for (ll i=1; i<=r; ++i) for (ll j=1; j<=c; ++j) cin >> v[i][j];
for (ll i=1; i<=c; ++i) idx[i] = -1;
for (ll i=1; i<=r; ++i)
{
//show(i);
// update last
for (ll j=1; j<=c; ++j) if (v[i][j]=='#') idx[j] = i;
ll now = 0;
for (ll j=1; j<=c; ++j)
{
if (idx[j]==-1 || i-idx[j] + 1 != now + 1) now = 0;
if (i-idx[j] + 1 == now + 1)now++;
dp1[i][j] = now;
}
now = 0;
for (ll j=c; j>=1; --j)
{
//show2(j, idx[j]);
//show(now);
if (idx[j]==-1 || i-idx[j] + 1 != now + 1) now = 0;
if (i-idx[j] + 1 == now + 1)now++;
dp2[i][j] = now;
//show2(dp1[i][j], dp2[i][j]);
}
}
for (ll i=1; i<=c; ++i) idx[i] = -1;
for (ll i=r; i>=1; --i)
{
// update last
for (ll j=1; j<=c; ++j) if (v[i][j]=='#') idx[j] = i;
ll now = 0;
for (ll j=1; j<=c; ++j)
{
if (idx[j]==-1 || idx[j]-i + 1 != now + 1) now = 0;
if (idx[j]-i + 1 == now + 1)now++;
dp3[i][j] = now;
}
now = 0;
for (ll j=c; j>=1; --j)
{
if (idx[j]==-1 || idx[j]-i + 1 != now + 1) now = 0;
if (idx[j]-i + 1 == now + 1)now++;
dp4[i][j] = now;
}
}
ll ans = 0;
for (ll i=1; i<=r; ++i) for (ll j=1; j<=c; ++j)
{
//show2(i, j);
//show(dp1[i][j]);show(dp2[i][j]);show(dp3[i][j]);show(dp4[i][j]);
if (dp1[i][j] >= 2 && dp1[i][j]==dp2[i][j] && dp2[i][j] == dp3[i][j] && dp3[i][j] == dp4[i][j])ans++;
}
cout << ans << endl;
return 0;
}
