import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf = 10L^^15;
enum mod = 10L ^^ 9 + 7;

void main() {
    int h, w;
    scan(h, w);
    auto ban = iota(h).map!(i => readln.chomp).array;
    auto dp = new long[][](h, w);
    dp[0][0] = 1;
    foreach (i ; 0 .. h) {
        foreach (j ; 0 .. w) {
            if (ban[i][j] == '#') {
                continue;
            }
            if (i > 0) {
                dp[i][j] += dp[i-1][j];
                dp[i][j] %= mod;
            }
            if (j > 0) {
                dp[i][j] += dp[i][j-1];
                dp[i][j] %= mod;
            }
        }
    }
    writeln(dp[h-1][w-1]);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}