// Vivek Rai
// Blazer_007

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>

#define fastio 		ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp	     make_pair
#define inf         0x3f3f3f3f
//#define INF         0x3f3f3f3f3f3f3f3fLL
#define ll          long long
#define pb          push_back
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pii>
#define mi          map<ll,ll>
#define mii         map<pii,ll>
#define ppi	    pair<ll,pii>
#define all(a)      (a).begin(),(a).end()
#define FF           first
#define SS           second
#define sz(x)       (int)x.size()
#define endl        '\n'
#define hell        1000000007
#define see(x)	    cout<<x<<endl;
#define see2(x,y)   cout<<x<<" "<<y<<endl;
#define see3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl;
#define bit(x, y)   (((x)>>(y))&1)
#define bpt(x)      (__builtin_popcount(x))
#define bptl(x)     (__builtin_popcountll(x))
#define loop(i,a,b)  for(int i=a;i<b;i++)
#define rloop(i,a,b) for(int i=a;i>=b;i--)
#define N 2000010

using namespace std;
//using namespace __gnu_pbds;

//typedef priority_queue<int> maxHeap;
//typedef priority_queue<int,vector<int>,greater<int>()) minHeap;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// find_by_order(index) -> value at given index or Kth smallest element in set
// order_of_key(X) -> number of elements strictly less than X
//typedef tree<pii , null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <typename Arg1>
    void __f(const char* name, Arg1&& arg1){
        cout << name << " : " << arg1 << endl;
        //use cerr if u want to display at the bottom
    }
    template <typename Arg1, typename... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
    }
#else
#define trace(...)
#endif

void solution(){
    int h,w;
    cin >> h >> w ;
    vector<string> grid(h);
    string row;
    loop(i,0,h){
    	cin >> row ;
    	grid[i] = row;
    }
    ll dp[h][w];
    dp[0][0]=0;
    loop(i,1,h){
    	dp[i][0] = -1LL;
    	if(grid[i][0]=='.'&&dp[i-1][0]!=-1LL){
    		dp[i][0] = 1LL;
    	}
    }
    loop(i,1,w){
    	dp[0][i] = -1LL;
    	if(grid[0][i]=='.'&&dp[0][i-1]!=-1LL){
    		dp[0][i] = 1LL;
    	}
    }
    loop(i,1,h){
    	loop(j,1,w){
    		dp[i][j] = -1;
    		if(grid[i][j]=='.'){
    			ll ans1=0 , ans2=0;
    			if(dp[i-1][j]!=-1)
    				ans1 = dp[i-1][j];
    			if(dp[i][j-1]!=-1)
    				ans2 = dp[i][j-1];
    			dp[i][j] = ans1 + ans2;
    			dp[i][j] %= hell;
    		}
    	}
    }

    // loop(i,0,h){
    // 	loop(j,0,w)
    // 		cout << dp[i][j] << ' ';
    // 	cout << endl;
    // }

    if(dp[h-1][w-1]==-1)
    	cout << 0 << endl;
    else
    	cout << dp[h-1][w-1] << endl;
}

signed main(){
    fastio
    // #ifndef ONLINE_JUDGE
    // 	freopen("input.txt", "r" , stdin);
    // 	freopen("output.txt", "w", stdout);
    // #endif

    ll t=1;
    // cin>>t;
    loop(i,1,t+1){
    	//cout<<"Case #"<<i<<": ";
    	solution();
    }
}




Measured memory_bytes: 9088