#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
ll d[mm],st[mm],num[mm];
ll sum[3000][3000];
string s[3000];
ll mod=1e9+7;
int main()
{
   ll n,m,i,j,t,a,b,c,p,k,kk; 
    scanf("%lld%lld",&n,&m);
	for(i=0;i<n;i++) cin>>s[i];
	d[0]=1; num[0]=1; st[m]=1;
	sum[0][0]=0;
	for(i=0;i<n;i++)
	for(j=0;j<m;j++)
	{
	  	if(i==0&&j==0) continue;
	  	if(s[i][j]=='.')
	  	{
	  	sum[i][j]=(sum[i][j]+d[i]+num[j]+st[i-j+m])%mod;
	  	d[i]=(d[i]+sum[i][j])%mod;
	  	num[j]=(num[j]+sum[i][j])%mod;
	  	st[i-j+m]=(st[i-j+m]+sum[i][j])%mod;
	    }
	    else
	    {
	    	d[i]=0; num[j]=0; st[i-j+m]=0;
	    	sum[i][j]=0;
		}
	//	cout<<i<<' '<<j<<' '<<sum[i][j]<<' '<<d[i]<<endl;
	}
	printf("%lld\n",sum[n-1][m-1]);
   
   
   
} 
#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 1e18;
const ll fact_table = 3200008;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/

bool icpc = false;
bool multicase = false;

ll n, m, k;
ll dp[3000][3000];
ll tatesum[3000][3000], yokosum[3005][3005], nanamesum[3005][3005];
string s[3005];


bool solve() {
    cin >> n >> m;
    rep(i, n) {
        cin >> s[i];
    }
    dp[1][1] = 1;
    tatesum[1][1] = yokosum[1][1] = nanamesum[1][1] = 1;
    rep2(i, 1, n) {
        rep2(j, 1, m) {
            if (s[i - 1][j - 1] == '#') continue;
            if (i + j == 2) continue;
            ll sum1 = tatesum[i - 1][j] + mod - tatesum[0][j];
            ll sum2 = yokosum[i][j - 1] + mod - yokosum[i][0];
            ll sum3;
            if (i >= j) {
                sum3 = nanamesum[i - 1][j - 1] + mod - nanamesum[i - j][0];
            } else {
                sum3 = nanamesum[i - 1][j - 1] + mod - nanamesum[0][j - i];
            }
            dp[i][j] = (sum1 + sum2 + sum3) % mod;
            tatesum[i][j] = (tatesum[i - 1][j] + dp[i][j]) % mod;
            yokosum[i][j] = (yokosum[i][j - 1] + dp[i][j]) % mod;
            nanamesum[i][j] = (nanamesum[i - 1][j - 1] + dp[i][j]) % mod;
        }
    }
    ll ans = dp[n][m];
    p(ans);
    return true;
}

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    if (icpc) {
        while (solve());
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }

// solve();
    return 0;
}