#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(j,n) for(int j = 0; j < (n); ++j)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define srep2(j,s,t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

int main() {
  int H,W;
  cin >> H >> W;
  string map[H][W];
  rep(i,H){
    string str;
    cin >> str;
    rep2(j,sz(str)){
      map[i][j] = str[j];
    }
  }
  int dp[H][W];
  dp[0][0] = 1;
  bool hflag = true;
  rep(i,H){
    if(map[i][0] == "." && hflag){
      dp[i][0] = 1;
    } else if (map[i][0] == "." && !hflag) {
      dp[i][0] = 0;
    } else {
      dp[i][0] = 0;
      hflag = false;
    }
  }
  bool wflag = true;
  rep(i,W){
    if(map[0][i] == "." && wflag){
      dp[0][i] = 1;
    } else if (map[0][i] == "." && !wflag) {
      dp[0][i] = 0;
    } else {
      dp[0][i] = 0;
      wflag = false;
    }
  }
  
  srep(i,1,min(H,W)){
    if(map[i][i] == "#") {
      dp[i][i] = 0;
    } else {
      dp[i][i] = (dp[i-1][i] + dp[i][i-1]) % ((int)pow(10,9) + 7);
    }
    srep2(j,i,H){
      if(map[j][i] == "#"){
        dp[j][i] = 0;
      } else {
        dp[j][i] = (dp[j-1][i] + dp[j][i-1]) % ((int)pow(10,9) + 7);
      }
    }
    srep2(j,i,W){
      if(map[i][j] == "#") {
        dp[i][j] = 0;
      } else {
        dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % ((int)pow(10,9) + 7);
      }
    }
  }
  cout << dp[H-1][W-1] << endl;
  return 0;
}

Measured memory_bytes: 58880