import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format, std.datetime;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long H, W;
    scan(H, W);
    auto A = new string[](H);
    foreach (i; 0 .. H)
        A[i] = sread();
    auto dp = new long[][](H, W);
    dp[0][0] = 1;
    foreach (h; 0 .. H - 1)
    {
        foreach (w; 0 .. W - 1)
            if (A[h][w] == '.')
            {
                dp[h + 1][w] = (dp[h + 1][w] + dp[h][w]) % MOD;
                dp[h][w + 1] = (dp[h][w + 1] + dp[h][w]) % MOD;
            }
        if (A[h][W - 1] == '.')
            dp[h + 1][W - 1] = (dp[h + 1][W - 1] + dp[h][W - 1]) % MOD;
    }
    foreach (w; 0 .. W - 1)
        if (A[H - 1][w] == '.')
            dp[H - 1][w + 1] = (dp[H - 1][w + 1] + dp[H - 1][w]) % MOD;
    writeln(dp[$ - 1][$ - 1]);
}
