#include <bits/stdc++.h>
using namespace std;
#define OPENIOBUF

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<16;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
};

class FastOutput final: public FastIOBase
{
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
	~FastOutput() { flush(); }
	void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
	void put(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
		putc(x,target);
#endif
	}
	FastOutput &operator <<(char x)
	{ return put(x),*this; }
	FastOutput &operator <<(const char *s)
	{ for(;*s;put(*(s++)));return *this; }
	FastOutput &operator <<(const std::string &s)
	{ return (*this)<<s.c_str(); }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(T x)
	{
		if(x<0) return put('-'),(*this)<<(-x);
		char stk[std::numeric_limits<T>::digits10+1],*top=stk;
		do *(top++)=x%10+'0',x/=10; while(x);
		while(top!=stk) put(*(--top));
		return *this;
	}
	template<typename ...T>
	void writesp(T &&...x)
	{ std::initializer_list<int>{((*this)<<(x),put(' '),0)...}; }
	template<typename ...T>
	void writeln(T &&...x)
	{ std::initializer_list<int>{((*this)<<(x),put('\n'),0)...}; }
	template<typename Iter>
	std::enable_if_t<std::is_base_of<
		std::forward_iterator_tag,
		typename std::iterator_traits<Iter>::iterator_category>
	::value> writesp(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<' '; }
	template<typename Iter>
	std::enable_if_t<std::is_base_of<
		std::forward_iterator_tag,
		typename std::iterator_traits<Iter>::iterator_category>
	::value> writeln(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;

class FastInput final: public FastIOBase
{
 private:
	bool __eof;
 public:
	FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
	{ buf_p=BUFSIZE; }
	void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
	bool eof()const { return buf[buf_p]==EOF; }
#else
	{}
	bool eof()const { return feof(target); }
#endif
	char get()
	{
		if(__eof) return EOF;
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		char ch=buf[buf_p++];
#else
		char ch=getc(target);
#endif
		return ~ch?ch:(__eof=true,EOF);
	}
	void unget(char c)
	{
		__eof=false;
#ifdef OPENIOBUF
		buf[--buf_p]=c;
#else
		ungetc(c,target);
#endif
	}
	explicit operator bool()const { return !__eof; }
	FastInput &operator >>(char &x)
	{ while(isspace(x=get()));return *this; }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
	{
		char ch,sym=0;x=0;
		while(isspace(ch=get()));
		if(__eof) return *this;
		if(ch=='-') sym=1,ch=get();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
		return unget(ch),sym?x=-x:x,*this;
	}
	FastInput &operator >>(char *s)
	{
		while(isspace(*s=get()));
		if(__eof) return *this;
		for(;!isspace(*s) && !__eof;*(++s)=get());
		return unget(*s),*s='\0',*this;
	}
	FastInput &operator >>(std::string &s)
	{
		char str_buf[(1<<8)+1]={0},*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=get()));
		if(__eof) return *this;
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
			if(p!=buf_end) break;
			s.append(str_buf);
		}
		unget(*p),*p='\0',s.append(str_buf);
		return *this;
	}
	template<typename ...T>
	void read(T &&...x)
	{ std::initializer_list<int>{((*this)>>(x),0)...}; }
	template<typename Iter>
	std::enable_if_t<std::is_base_of<
		std::forward_iterator_tag,
		typename std::iterator_traits<Iter>::iterator_category>
	::value> read(Iter begin,Iter end)
	{ while(begin!=end) (*this)>>*(begin++); }
}qin;

} // namespace FastIO
using FastIO::qin,FastIO::qout;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) [](auto...){}(__VA_ARGS__)
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif

constexpr int MAXN=3000;

int n,m;
char s[MAXN+5][MAXN+5];

bool fs[MAXN+5][MAXN+5],ft[MAXN+5][MAXN+5],visa[MAXN+5][MAXN+5],visb[MAXN+5][MAXN+5];
int gs[MAXN+5][MAXN+5],gt[MAXN+5][MAXN+5];

int main()
{
	qin>>n>>m;
	for(int i=1;i<=n;i++) qin>>(s[i]+1);
	
	fs[1][1]=(s[1][1]=='.');
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(s[i][j]=='.') fs[i][j]|=fs[i-1][j]|fs[i][j-1];
	ft[n][m]=(s[n][m]=='.');
	for(int i=n;i>=1;i--)
		for(int j=m;j>=1;j--)
			if(s[i][j]=='.') ft[i][j]|=ft[i+1][j]|ft[i][j+1];
	LL all=0,ans=0;
	for(int i=1;i<=n;i++)
		all+=count(s[i]+1,s[i]+m+1,'.');
	if(!fs[n][m]) ans=all*(all-1)/2;
	else
	{
		vector<pair<int,int>> A{{1,1}},B{{1,1}};
		for(int x=1,y=1;x!=n || y!=m;)
		{
			if(ft[x][y+1]) y++;
			else x++;
			A.emplace_back(x,y);
		}
		for(int x=1,y=1;x!=n || y!=m;)
		{
			if(ft[x+1][y]) x++;
			else y++;
			B.emplace_back(x,y);
		}
		for(auto &[x,y]: A) visa[x][y]=true;
		for(auto &[x,y]: B) visb[x][y]=true;
		for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
		{
			gs[i][j]=(visa[i][j] && !visb[i][j]);
			if(fs[i][j-1]) gs[i][j]+=gs[i][j-1];
			else gs[i][j]+=gs[i-1][j];
		}
		for(int i=n;i>=1;i--) for(int j=m;j>=1;j--)
		{
			gt[i][j]=(visa[i][j] && !visb[i][j]);
			if(ft[i+1][j]) gt[i][j]+=gt[i+1][j];
			else gt[i][j]+=gt[i][j+1];
		}
		LL cnt=0;
		for(auto &[x,y]: B)
		{
			if(visa[x][y]) { cnt++;continue; }
			int xx=x-1,yy=y+1;
			while(!(fs[xx][yy] && ft[xx][yy]) && xx>=1 && yy<=m)
				xx--,yy++;
			assert(xx>=1 && yy<=m);
			ans+=(gs[xx][yy]+gt[xx][yy]-visa[xx][yy]);
		}
		ans+=cnt*(all-cnt)+cnt*(cnt-1)/2;
	}
	qout<<ans<<'\n';
	return 0;
}