#include<bits/stdc++.h>
using namespace std;
struct time_helper
{
#ifdef LOCAL
	clock_t time_last;
#endif
	time_helper()
	{
#ifdef LOCAL
		time_last=clock();
#endif
	}
	void test()
	{
#ifdef LOCAL
		auto time_now=clock();
		std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;
		time_last=time_now;
#endif
	}
	~time_helper()
	{
		test();
	}
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
#define Setprecision 10
#define between ' '
#define __int128 long long
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(T x){for(auto &y:x)*this<<y<<between;*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-Setprecision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(T c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(std::string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void solve();
main()
{
	int t=1;
	// cin>>t;
	while(t--)solve();
}
void solve()
{
	int n,m;
	cin>>n>>m;
	vector<vector<char>>mp(n+1,vector<char>(m+1));
	int c=0;
	for(int x=1;x<=n;x++)
	for(int y=1;y<=m;y++)
	cin>>mp[x][y],c+=mp[x][y]=='.';
	vector<vector<int>>reachable(n+1,vector<int>(m+1));
	vector<vector<int>>ir(n+1,vector<int>(m+1));
	auto get_path=[&]()
	{
		vector<pair<int,int>>path1,path2;
		for(int x=n;x>=1;x--)
		for(int y=m;y>=1;y--)
		{
			if(mp[x][y]=='*')reachable[x][y]=0;
			else if(x==n&&y==m)reachable[x][y]=1;
			else if(x==n)reachable[x][y]=reachable[x][y+1];
			else if(y==m)reachable[x][y]=reachable[x+1][y];
			else reachable[x][y]=reachable[x+1][y]||reachable[x][y+1];
		}
		if(!reachable[1][1])return make_pair(path1,path2);
		for(int x=1;x<=n;x++)
		for(int y=1;y<=m;y++)
		{
			if(mp[x][y]=='*')ir[x][y]=0;
			else if(x==1&&y==1)ir[x][y]=1;
			else if(x==1)ir[x][y]=ir[x][y-1];
			else if(y==1)ir[x][y]=ir[x-1][y];
			else ir[x][y]=ir[x-1][y]||ir[x][y-1];
		}
		int u=1,v=1;
		while(u!=n||v!=m)
		{
			path1.emplace_back(u,v);
			if(v!=m&&reachable[u][v+1])v++;
			else u++;
		}
		path1.emplace_back(u,v);
		u=1,v=1;
		while(u!=n||v!=m)
		{
			path2.emplace_back(u,v);
			if(u!=n&&reachable[u+1][v])u++;
			else v++;
		}
		path2.emplace_back(u,v);
		return make_pair(path1,path2);
	};
	auto [path1,path2]=get_path();
	if(path1.empty()){cout<<1ll*c*(c-1)/2<<endl;return;}
	vector<vector<int>>vis(n+1,vector<int>(m+1));
	int ans1=0,ans2=0;
	for(int x=0;x<path1.size();x++)
	if(path1[x]==path2[x])vis[path1[x].first][path1[x].second]=1,ans1++,ans2+=c-ans1;
	for(int x=0;x<path1.size();x++)
	if(!vis[path1[x].first][path1[x].second])
	{
		int u=path1[x].first,v=path1[x].second;
		u++,v--;
		while(!ir[u][v]||!reachable[u][v])u++,v--;
		int k=x;
		while(u!=n||v!=m)
		{
			if(make_pair(u,v)==path2[k]&&!vis[u][v])ans2++;
			k++;
			if(v!=m&&reachable[u][v+1])v++;
			else u++;
		}
		u=path1[x].first,v=path1[x].second;
		u++,v--;
		while(!ir[u][v]||!reachable[u][v])u++,v--;
		k=x;
		while(u!=1||v!=1)
		{
			k--;
			if(u!=1&&ir[u-1][v])u--;
			else v--;
			if(make_pair(u,v)==path2[k]&&!vis[u][v])ans2++;
		}
	}
	cout<<ans2<<endl;
}
/*
*/