# include <bits/stdc++.h>

using namespace std;

# define int long long
# define PII pair< int , int >
# define MP make_pair
# define fi first
# define se second

const int N = 3e3 + 5;
int n , m , cnt , ans , f[N][N] , g[N][N];
char mp[N][N];
vector< int > vec[N<<1];

signed main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cin >> mp[i][j] , cnt += mp[i][j] == '.';
	f[1][1] = mp[1][1] == '.';
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) if(mp[i][j] == '.') f[i][j] = f[i][j - 1] | f[i - 1][j];
	g[n][m] = mp[n][m] == '.';
	for(int i = n; i; i--) for(int j = m; j; j--) if(mp[i][j] == '.') g[i][j] = g[i][j + 1] | g[i + 1][j];
	if(!f[n][m]) return cout << cnt * (cnt - 1) / 2 , 0;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) if(f[i][j] && g[i][j]) vec[i + j].push_back(i);
	for(int i = 2; i <= n + m; i++) if(vec[i].size() == 1) ans += --cnt;
	for(int i = 2; i <= n + m; i++)
	{
		auto &v = vec[i];
		if(v.size() == 1) continue ;
		int l = v[1] , r = v[v.size() - 1];
		if(l == r) ans++;
		for(int j = i + 1; j <= n + m; j++)
		{
			if(mp[l][j - l] == '*') l++;
			if(mp[r + 1][j - (r + 1)] == '.') r++;
			if(l == r && vec[j].size() > 1) ans++;
		}
		l = v[0] , r = v[v.size() - 2];
		for(int j = i + 1; j <= n + m; j++)
		{
			if(mp[l][j - l] == '*') l++;
			if(mp[r + 1][j - (r + 1)] == '.') r++;
			if(l == r && vec[j].size() > 1) ans++;
		}
	}
	cout << ans;
	return 0;
}