#include<bits/stdc++.h>


//      DEEP


using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pi;
typedef set<int> si;
const ll mod = 1e9 + 7;
const ll mod1=998244353;
const double pie=3.1415926535;
                                                    //power
ll power(ll x,ll y){
   if(y==0) return 1;
   else{
     if(y%2==0) return power(x*x,y/2);
     else return x*power(x*x,(y-1)/2);
   }
}

                        //                    Modular Exponentiation

ll mod_power(ll x, ll y, ll m)
{
    ll r = 1;     // Initialize result

    x = x % m; // Update x if it is more than or equal to m

    if (x == 0) return 0; // In case x is divisible by m;

    while (y > 0)
    {
        // If y is odd, multiply x with result
        if (y & 1)
            r = (r*x) % m;

        // y must be even now
        y = y/2;
        x = (x*x) % m;
    }
    return r;
}

                                                      //GCD
ll gcd(ll x,ll y){
   if(y==0)return x;
   return gcd(y,x%y);
}
//                                         EXTENDED_EUCLID
vector<ll>extended_Euclid(ll a,ll b){
    vector<ll>v(3);
    if(b==0){
        v[0]=a;v[1]=1;v[2]=0;
        return v;
    }
    else{
         vector<ll>v1 = extended_Euclid(b,a%b);    //recursive call
         v[0]=v1[0];
         v[1]=v1[2];
         v[2]=v1[1]-(a/b)*v1[2];
         return v;
    }
}
                                          // DFS ( number of connected components  )
//vector<vector<ll> >adj(200001);
//bool visited[200001];
/*ll dfs(int x,int c){                         // x - > node      c - > number of edges in the component
    if(visited[x])return c;
    else{
        visited[x]=true;
        int y=c;
        for(int i=0;i<adj[x].size();i++){
            if(!visited[adj[x][i]]){
                c+=1;
                int d=dfs(adj[x][i],y);
                c+=d;
            }
        }
        return c;
    }
}
*/
                                              // SIEVE

/*
bool isPrime[100001];
void sieve(int N) {

        for(int i = 0; i <= N;++i) {
            isPrime[i]=true;
        }
        isPrime[0]=false;
        isPrime[1]=false;

        for(int i = 2; i * i <= N; ++i) {
             if(isPrime[i] == true) {
                 for(int j = i * i; j <= N ;j += i)
                     isPrime[j] = false;
            }
        }
    }
*/
                               // Binary Search
/*
ll bin_search(ll y){
  while(lo<hi){
    x=lo+(hi-lo)/2;
    if(condition){
            .....
    }
    else{
                  // increase lo or decrease hi suitably
            }
   }
}
*/
map<pi,ll>dp;
int H,W;
bool visited[1001][1001];
char arr[1000+1][1000+1];
void dfs(int x,int y){
    visited[x][y]=true;
   if(x==H-1 && y==W-1){
    dp[mp(x,y)]=1;
   }
   else{
    if(x!=(H-1) && arr[x+1][y]=='.'){
        if(!visited[x+1][y])dfs(x+1,y);
    }
    if(y!=(W-1) && arr[x][y+1]=='.'){
        if(!visited[x][y+1])dfs(x,y+1);
    }
    dp[mp(x,y)]=(dp[mp(x+1,y)]%mod + dp[mp(x,y+1)]%mod)%mod;
   }
}
int main(){
    boost;
    int TESTS=1;
    //cin>>TESTS;
    while(TESTS--){

        cin>>H>>W;

        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                cin>>arr[i][j];
                if(arr[i][j]=='#')dp[mp(i,j)]=0;
            }
            arr[i][W]='#';
            dp[mp(i,W)]=0;
        }
        for(int i=0;i<=W;i++){
                arr[H][i]='#';
                dp[mp(H,i)]=0;
        }
        memset(visited,false,sizeof(visited));
        dfs(0,0);
        cout<<dp[mp(0,0)]<<endl;
    }
}
/* Be careful about integer ranges;
   Check the corner cases before submitting.
*/











Measured memory_bytes: 68272