#include<cstring>

#include<iostream>

#include<cstdio>

#include<queue>

#include<cmath>

#include<algorithm>

#define rep(i,l,r) for (int i=l;i<=r;i++)

#define down(i,l,r) for (int i=l;i>=r;i--)

#define clr(x,y) memset(x,y,sizeof(x))

#define low(x) (x&(-x))

#define maxn 3005

#define inf int(1e9)

#define mm 1000000007

#define ll long long

using namespace std;

ll f[maxn][maxn],ans1,ans2,ans3,ans4;

int n,m,mp[maxn][maxn];

char s[maxn];

ll read(){

    ll x=,f=; char ch=getchar();

    while (!isdigit(ch)) {if (ch=='-') f=-; ch=getchar();}

    while (isdigit(ch)) {x=x*+ch-''; ch=getchar();}

    return x*f;

}

int main(){

    n=read(); m=read();

    rep(i,,n){

        scanf("%s",s+);

        rep(j,,m) if (s[j]=='#') mp[i][j]=;

    }

    if (mp[][]==||mp[][]==) {puts(""); return ;}

    f[][]=;

    rep(i,,n) rep(j,,m) if (!mp[i][j]) f[i][j]+=(f[i-][j]+f[i][j-])%mm;

    ans1=f[n-][m]; ans3=f[n][m-];

    clr(f,); f[][]=;

    rep(i,,n) rep(j,,m) if (!mp[i][j]) f[i][j]+=(f[i-][j]+f[i][j-])%mm;

    ans2=f[n][m-]; ans4=f[n-][m];

    printf("%lld\n",((ans1*ans2-ans3*ans4)%mm+mm)%mm);

    return ;

}