#pragma region template
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) (int)(a).size()
#define last(a) (a).at((int)(a).size()-1)
#define rep(i,n) for(ll i=0,i##_len=(n);i<i##_len;i++)
#define brep(i,a,b) for(ll i=(a),i##_len=(b);i<=i##_len;i++)
#define rrep(i,n) ll i=(n);ll now=-1;while(i--&&(now++||1))
#define xrep(i,n) for(ll i=1,i##_len=(n);i<=i##_len;i++)
#define Yes(n) cout<<((n)?YES:NO)<<'\n'
#define rYes(n) cout<<((n)?YES:NO)<<'\n';return
#define co(n) cout<<(n)<<'\n'
#define rco(n) cout<<(n)<<'\n';return
#define Sort(v) sort(all(v))
#define rSort(v) sort(all(v),greater<typeof(v[0])>())
#define Rev(v) reverse(all(v))
#define Unique(v) (v).erase(unique(all(v)),(v).end())
#define eb emplace_back
#define fi first
#define se second
#define index f89dsjj4
#define next ytjbmy8k
#define prev j4qzjkys

using namespace std;
using ll = long long;
using vll = vector<ll>;
using vbl = vector<bool>;
using vint = vector<int>;
using vvll = vector<vll>;
using vstr = vector<string>;

const ll INF = 1e18;
const ll MAX = 1000000;
const ll MOD = 1000000007;

// --- functions which take 1 argument ---
static inline void ignore_ret(int x){x++;}
template<class T> inline int sgn(T x){return (x>0)-(x<0);}
template<class T> inline ll factorial(T n){if(n==0)return 1;ll r=1;for(T i=2;i<=n;i++)r*=i;return r;}
template<class T> inline map<T,T> factorize(T n){map<T,T>r;for(T i=2;i*i<=n;i++){while(n%i==0){r[i]++;n/=i;}}if(n!=1)r[n]=1;return r;}
template<class T> inline vector<T> divisor(T n){vector<T>r;for(T i=1;i*i<=n;i++){if(!(n%i)){r.eb(i);if(i*i!=n)r.eb(n/i);}}Sort(r);return r;}

// --- functions which take 2 arguments ---
template<class T> inline bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T> inline T nPr(T n,T k){if(n<k||n<0||k<0)return 0;T r=1;for(T i=n-k+1;i<=n;i++)r*=i;return r;}
template<class T> inline T nCr(T n,T k){if(n<k||n<0||k<0)return 0;T r=1;k=min(k,n-k);for(T i=n-k+1;i<=n;i++)r*=i;return r/factorial(k);}

// --- functions which take vector(s) as argument(s) ---
template<class T> inline void print(T v){cout<<"[ ";for(auto x:v)cout<<x<<' ';cout<<"]\n";}
template<class T> inline void print_2d(vector<T>v){for(T x:v)print<T>(x);}
template<class T> inline void print_d(T v,string d){rep(i,(ll)v.size()-1)cout<<v[i]<<d;cout<<v[(ll)v.size()-1]<<'\n';}
template<class T> inline void print_2d_d(vector<T>v,string d){for(T x:v)print_d<T>(x,d);}
template<class T> inline T min(vector<T>v){return *min_element(all(v));}
template<class T> inline T max(vector<T>v){return *max_element(all(v));}
template<class T> inline ll sum(T v){return reduce(all(v),0LL);}
template<class T> inline T gcd(vector<T>v){T r=v[0];for(T i=1;i<v.size();i++)r=gcd(r,v[i]);return r;}
template<class T> inline T lcm(vector<T>v){T r=v[0];for(T i=1;i<v.size();i++)r=lcm(r,v[i]);return r;}
template<class T> inline double abs(vector<T> v){return sqrt(reduce(all(v),0.0,[](T s,T v){return s+=v*v;}));}
template<class T> inline T vector_add(T u,T v){T r;rep(i,u.size())r.eb(u[i]+v[i]);return r;}
template<class T> inline T vector_subtract(T u,T v){T r;rep(i,u.size())r.eb(u[i]-v[i]);return r;}
template<class T> inline T dot_product(vector<T>u,vector<T>v){if(u.size()<v.size())return 0;T r=0;for(T i=0;i<u.size();i++)r+=u[i]*v[i];return r;}
template<class T> inline T cross_product(T u,T v){T r(3);r[0]=u[1]*v[2]-u[2]*v[1];r[1]=u[2]*v[0]-u[0]*v[2];r[2]=u[0]*v[1]-u[1]*v[0];return r;}

// --- functions which take set(s) as argument(s) ---
template<class T> inline T min(set<T>v){return *min_element(all(v));}
template<class T> inline T max(set<T>v){return *max_element(all(v));}
template<class T> inline T gcd(set<T>v){T r=0;for(T x:v)r=(r==0)?x:gcd(r,x);return r;}
template<class T> inline T lcm(set<T>v){T r=0;for(T x:v)r=(r==0)?x:lcm(r,x);return r;}

// --- mod-oriented functions ---
vll fac(MAX),finv(MAX),inv(MAX);
void nCr_mod_init() {
  fac[0]=fac[1]=finv[0]=finv[1]=inv[1]=1;
  brep(i,2,MAX-1){fac[i]=fac[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}
}

template<class T> inline ll factorial_mod(T n){if(n==0)return 1;ll r=1;for(T i=2;i<=n;i++){r*=i;r%=MOD;}if(r<0)r+=MOD;return r;}
template<class T> inline T inv_mod(T a){T b=MOD,r=1,v=0;while(b){T t=a/b;a-=t*b;swap(a,b);r-=t*v;swap(r,v);}r%=MOD;if(r<0)r+=MOD;return r;}
template<class T> inline T nCr_mod(T n,T k){if(n<k)return 0;if(n<0||k<0)return 0;return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
template<class T> inline T pow_mod(T a,T n){T r=1;while(n>0){if(n&1)r=r*a%MOD;a=a*a%MOD;n>>=1;}return r;}

// --- Template ends here ---
#pragma endregion template

void solve(ll H, ll W, vstr a) {
  vvll dp(H, vll(W, 0));

  for (ll i = 0; i < H; i++) {
    for (ll j = 0; j < W; j++) {
      if (a[i][j] == '#') {
        dp[i][j] = 0;
        continue;
      }
      if (i == 0 && j == 0) {
        dp[i][j] = 1;
        continue;
      }
      dp[i][j] = 0;
      if (i - 1 >= 0) {
        dp[i][j] += dp[i-1][j];
      }
      if (j - 1 >= 0) {
        dp[i][j] += dp[i][j-1];
      }
      dp[i][j] %= MOD;
    }
  }

  cout << last(last(dp)) << '\n';
}

int main() {
  // nCr_mod_init();

  ll H;
  ignore_ret(scanf("%lld",&H));
  ll W;
  ignore_ret(scanf("%lld",&W));
  vstr a(H);
  for (int i = 0; i < H; i++) {
    string given;
    cin >> given;
    a[i] = given;
  }
  solve(H, W, move(a));
  return 0;
}


Measured memory_bytes: 32640