#include<iostream>
#include<map>
#include<vector>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm> 
#include<climits>
#include<stack>
#include<queue>
#include<set>
#include<cctype>
#include<bitset> 
#include<type_traits>
#include<numeric>
#include<array>
using namespace std;

# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s)  std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<int,int> P_ii;
typedef pair<double,double> P_dd;

template<class T>
vector<T> make_vec(size_t a){
    return vector<T>(a);
}

template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}

const int mod = 1000000007;
const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;

void addM(long long &a, long long b) {
    a += b;
    if (a >= MOD) a -= MOD;
}

void mulM(long long &a, long long b) {
    a = ((a%MOD)*(b%MOD))%MOD ;
}

// a^b mod M
long myPow(long a,long b,int M) {
    long ret = 1;
    long tmp = a;
    while(b>0) {
        if((b&1)==1) ret = (ret * tmp) % M;
        tmp = (tmp * tmp) % M;
        b = b>>1;
    }
    return ret;
}

 // nCk mod M
int nCk(int n,int k,int M) {
    long ret = 1;
    int mi = min(k, n-k);
    for(int i=1;i<=mi;i++) {
        ret = (ret * myPow(i,M-2,M)) % M;
    }
    for(int i=n-mi+1;i<=n;i++) {
        ret = (ret * i) % M;
    }
    return (int)ret;
}

int main(){

    int H,W;cin >> H >> W;

    auto g = make_vec<char>(H,W);
    REP(i,H) REP(j,W) cin >> g[i][j]; 

    auto dp = make_vec<ll>(H+1,W+1); 
    fill_v(dp,0);
    dp[0][0]=1;

    queue<P_ii> que;
    queue<P_ii> que_next;

    que.push({0,0});
    int di[] = {1,0};
    int dj[] = {0,1};
    set<int> se;
    while(que.size()>0){
        while(que.size()>0){
            P_ii p = que.front();que.pop();
            
            int i=p.first;
            int j=p.second;
            if(i-1>=0) addM(dp[i][j],dp[i-1][j]);
            if(j-1>=0) addM(dp[i][j],dp[i][j-1]);

            REP(k,2){
                int ni = i + di[k];
                int nj = j + dj[k];
                if(ni >= H || nj >= W || se.count(ni*W+nj) || g[ni][nj]=='#') continue;            
                se.insert(ni*W+nj);
                que_next.push({ni,nj});
            }
        }
        while(que_next.size()>0) {
            que.push(que_next.front());
            que_next.pop();
        }
    }

    pl(dp[H-1][W-1])

    return 0;
}

Measured memory_bytes: 55936