#include <bits/stdc++.h>
using namespace std;
const int N = 1001, MOD = 1000000007;
int a[N][N];
char ch[N][N];
int main() {
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++)
        scanf("%s", ch[i] + 1);
    a[0][1] = 1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (ch[i][j] == '.')
                a[i][j] = (a[i - 1][j] + a[i][j - 1]) % MOD;
    cout << a[n][m] << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=1001, MOD=1000000007;
int a[N][N];
char ch[N][N];
int main() {
	int n,m;cin>>n>>m;
	for(int i=1; i<=n; i++)
		scanf("%s",ch[i]+1);
	a[0][1]=1;
	for(int i=1; i<=n; i++)
		for(int j=1; j<=m; j++)
			if(ch[i][j]=='.')
				a[i][j]=(a[i-1][j]+a[i][j-1])%MOD;
	cout<<a[n][m]<<endl;
	return 0;
}