#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 1050;
const int MOD = 1e9 + 7;
char mat[maxn][maxn];
int n, m;
int dp[maxn][maxn];
int rec(int i, int j) {
    if(i == n - 1 and j == m - 1) {
        return 1;
    }

    if(dp[i][j] != -1) {
        return dp[i][j];
    }

    int res = 0;
    if(i + 1 < n and mat[i + 1][j] != '#') {
        res += rec(i + 1, j);
        res %= MOD;
    }

    if(j + 1 < m and mat[i][j + 1] != '#') {
        res += rec(i, j + 1);
        res %= MOD;
    }

    dp[i][j] = res;
    return res;
}
int main() {
    for(int i = 0; i < maxn; i++) {
        for(int j = 0; j < maxn; j++) {
            dp[i][j] = -1;
        }
    }

    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }

    cout << rec(0, 0) << endl;


    return 0;
}