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

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

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;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

void main()
{
    auto dp = new long[][](1000 + 2, 1000 + 2);
    long H, W;
    scan(H, W);
    // if (H != 3)
    //     return;
    dp[0][] = 0;
    foreach (row; dp)
        row[0] = 0;

    dp[1][1] = 1;

    foreach (i; 1 .. H + 1)
    {
        auto s = sread();
        foreach (j; 1 .. W + 1)
            if (s[j - 1] == '.')
            {
                // writefln("(%d %d): %d + %d", i, j, dp[i - 1][j], dp[i][j - 1]);
                dp[i][j].maxAssign((dp[i - 1][j] + dp[i][j - 1]) % (10 ^^ 9 + 7));
            }
            else
            {
                dp[i][j] = 0;
            }
    }
    dp[H][W].writeln();
}
