// Slower C++ solution:


/**

    And in the end, the love you take is equal to the love you make.



        I LOVE YOU LAURA.

**/



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/rope>



#define _CRT_SECURE_NO_DEPRECATE

#define _CRT_DISABLE_PERFCRIT_LOCKS



#define findOrder find_by_order

#define orderKey order_of_key



#define isOn(mask, i) (mask & (1 << i))

#define turn(mask, i) (mask |= (1 << i))

#define switch(mask, i) (mask &= ~(1 << i))

#define change(mask, i) (mask ^= (1 << i))

#define lowbit(mask) (mask & (-mask))

#define turnAll(mask, n) (mask = (1 << n) - 1)

#define switchLastBit(mask) (mask & (mask - 1))

#define turnLastZero(mask) (mask | (mask + 1))

#define modulo(x, mod) ((x) & (mod - 1))

#define log2(x) (31 - __builtin_clz(x))



#define mkp make_pair

#define pb push_back

#define pf push_front

#define eb emplace_back

#define ef emplace_front

#define ins insert

#define rsz resize

#define f first

#define s second

#define lb lower_bound

#define ub upper_bound



#define sz(x) ((int)x.size())

#define all(x) begin(x), end(x)

#define rall(x) rbegin(x), rend(x)



#define debug(x) (cerr << x << " ")



using namespace std;

using namespace __gnu_pbds;

using namespace __gnu_cxx;



typedef double db;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;



typedef pair<int, int> ii;

typedef pair<ll,ll> pll;

typedef pair<ld,ld> pdb;

typedef pair<int, ii> tri;

typedef complex<ld> cd;



typedef vector<int> vi;

typedef vector<ii> vii;

typedef vector<ld> vdb;

typedef vector<cd> vcd;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<vll> matrix;



typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_tree;



const ll mod = 1e9+7;

const int maxn = 1005;

const int pi = 2 * acos(0.0);

const db eps = 1e-9;



int n, m;

char arr[maxn][maxn];



bool ok (int x, int y){

    return (x >= 1 && x <= n && y >= 1 && y <= m);

}



int dx[] = {0, 1};

int dy[] = {1, 0};



ll dp[maxn][maxn];



ll dfs (int x, int y){

    if (!ok(x, y) || arr[x][y] == '#') return 0LL;

    if (x == n && y == m){

        return 1LL;

    }



    ll &ans = dp[x][y];



    if (ans != -1) return ans % mod;



    ans = 0;

    for (int i = 0; i < 2; i++){

        int nx = x + dx[i];

        int ny = y + dy[i];

        ans = (ans + dfs(nx, ny)) % mod;

    }



    return ans % mod;

}



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    memset(dp, -1, sizeof dp);



    cin >> n >> m;



    for (int i = 1; i <= n; i++){

        for (int j = 1; j <= m; j++){

            cin >> arr[i][j];

        }

    }



    cout << dfs(1, 1) % mod << "\n";



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.8635375722926888x):
#include<bits/stdc++.h>

#define ll long long

#define Test int t;cin>>t;while(t--)

#define PI acos(-1)

#define endl "\n"

#define fx(x) fixed<<setprecision(x)

#define sz(s) (int)s.size()

#define all(v) (v).begin(),(v).end()

#define allr(v) (v).rbegin(),(v).rend()

#define mem(a,n) memset((a),n,sizeof (a))

const double eps=1e-9;

const int mod=1e9+7;

int dx[]={-1,-1,-1,0,0,1,1,1};

int dy[]={-1,0,1,-1,1,-1,0,1};

ll gcd(ll x,ll y) {return(!y)?x:gcd(y,x%y);}

ll lcm(ll x,ll y) {return((x/gcd(x,y))*y);}

using namespace std;

void fast(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

}

int dp[1001][1001];

int n,m;

char a[1001][1001];

bool valid(int i,int j){

    return (i>=0&&i<n&&j>=0&&j<m&&a[i][j]!='#');

}

int solve(int i,int j){

    if(i==n-1&&j==m-1)return 1;

    int &ret=dp[i][j];

    if(~ret)return ret;

    ret=0;

    if(valid(i+1,j))ret+=solve(i+1,j)%mod;

    if(valid(i,j+1))ret+=solve(i,j+1)%mod;

    return ret%mod;

}

int main()

{

    mem(dp,-1);

    cin>>n>>m;

    for(int i=0;i<n;i++){

        for(int j=0;j<m;j++){

            cin>>a[i][j];

        }

    }

    cout<<solve(0,0);

    return 0;

}