#include<bits/stdc++.h>

#define reg register int

#define il inline

#define fi first

#define se second

#define mk(a,b) make_pair(a,b)

#define numb (ch^'0')

#define pb push_back

#define solid const auto &

#define enter cout<<endl

#define pii pair<int,int>

using namespace std;

typedef long long ll;

template<class T>il void rd(T &x){

    char ch;x=;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);

    for(x=numb;isdigit(ch=getchar());x=x*+numb);(fl==true)&&(x=-x);}

template<class T>il void output(T x){if(x/)output(x/);putchar(x%+'');}

template<class T>il void ot(T x){if(x<) putchar('-'),x=-x;output(x);putchar(' ');}

template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}

namespace Modulo{

const int mod=;

int ad(int x,int y){return (x+y)>=mod?x+y-mod:x+y;}

void inc(int &x,int y){x=ad(x,y);}

int mul(int x,int y){return (ll)x*y%mod;}

void inc2(int &x,int y){x=mul(x,y);}

int qm(int x,int y=mod-){int ret=;while(y){if(y&) ret=mul(x,ret);x=mul(x,x);y>>=;}return ret;}

template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}

template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}

}

using namespace Modulo;

namespace Miracle{

const int N=;

const int M=;

int f[M][N][<<][];

char mp[M][N],tc[N][M];

int n,m;

int val(int i,int j,int c,int s){

    int ret=;

    if(c==){

        if(i!=&&((s>>(j-))&)) ++ret;

        if(j!=&&((s>>(j-))&)) ++ret;

        return ret;

    }else{

        if(i!=) ++ret;

        if(j!=) ++ret;

        return ret;

    }

}

int main(){

    rd(n);rd(m);

    for(reg i=;i<=n;++i){

        scanf("%s",tc[i]+);

    }

    swap(n,m);

    for(reg i=;i<=n;++i){

        for(reg j=;j<=m;++j){

            mp[i][j]=tc[m-j+][i];

            // cout<<mp[i][j];

        }

        // cout<<endl;

    }

    f[][m][][]=mod-;

    int sum=;

    for(reg i=;i<=n;++i){

        for(reg j=;j<=m;++j){

            // cout<<" now "<<"("<<i<<","<<j<<")"<<endl;

            for(reg s=;s<(<<m);++s){

                for(reg x=;x<=sum;++x){

                    //no choose

                    int li,lj;

                    if(j==) li=i-,lj=m;

                    else li=i,lj=j-;

                    if(!f[li][lj][s][x]) continue;

                    int v=f[li][lj][s][x];

                    int ns=s;

                    if((s>>(j-))&) ns^=(<<(j-));

                    inc(f[i][j][ns][x+val(i,j,,s)],v);

                    if(mp[i][j]=='*'){

                        //choose

                        ns|=(<<(j-));

                        inc(f[i][j][ns][x+val(i,j,,s)],mod-v);

                    }

                }

            }

            int ct=;

            if(i!=) ++ct;

            if(j!=) ++ct;

            sum+=ct;

            // cout<<" sum "<<sum<<endl;

            // for(reg s=0;s<(1<<m);++s){

            //     for(reg x=0;x<=sum+10;++x){

            //         cout<<" s "<<s<<" x "<<x<<" : "<<f[i][j][s][x]<<endl;

            //     }

            // }

        }

    }

    ll ans=;

    // cout<<sum<<endl;

    for(reg s=;s<(<<m);++s){

        for(reg x=;x<=sum;++x){

            ans=ad(ans,mul(f[n][m][s][x],mul(sum,qm(x))));

        }

    }

    ot(ans);

    return ;

}

}

signed main(){

    Miracle::main();

    return ;

}

/*

   Author: *Miracle*

*/