#include<bits/stdc++.h>

#define rep(x,y,z) for(int x=y;x<=z;x++)
#define per(x,y,z) for(int x=z;x>=y;x--)

using namespace std;

const int N=11,Max=2e5+10,mod=10007;

int li[N][N],n,m,idx;
int lim[1<<N],cnt[1<<N],nt[1<<N];
int dp[Max][28],id[1<<20],cur[Max];

void dfs(int i,int j,int step)
{
    if(i==n+m+1)
    {
        if(j==n) id[step]=++idx,cur[idx]=step;
        return ;
    }
    dfs(i+1,j+1,step|(1<<i-1));
    dfs(i+1,j,step);
}

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

void work()
{
    cin>>n>>m;
    rep(i,0,(1<<m)-1) cnt[i]=__builtin_popcount(i);
    idx=0;
    rep(i,1,n)
    {
        string s;
        cin>>s;
        rep(j,1,m)
            li[i][j]=s[j-1]=='.'?0:s[j-1];
    }
    dfs(1,0,0);
    rep(i,1,idx) rep(j,1,26) dp[i][j]=0;
    dp[1][0]=1;
    rep(i,1,idx)
    {
        vector<array<int,3>> cro;
        int x=n,y=0;
        rep(j,1,n+m-1)
        {
            if(cur[i]>>j-1&1) x--;
            else y++;
            if((cur[i]>>j-1&1)&&!(cur[i]>>j&1)) cro.push_back({x,y,j});
        }
        int t=cro.size();
        rep(j,1,(1<<t)-1)
        {
            lim[j]=0;
            nt[j]=cur[i];
            rep(k,0,t-1)
                if(j>>k&1)
                {
                	nt[j]^=1<<cro[k][2]-1,nt[j]^=1<<cro[k][2];
                    int l=li[cro[k][0]+1][cro[k][1]+1];
                    if(!l) continue;
                    if(!lim[j]) lim[j]=l;
                    else if(l!=lim[j]) {lim[j]=-1;break;}
                }
        }
        rep(j,1,26)
        {
            dp[i][j]=add(dp[i][j],dp[i][j-1]);
            rep(k,1,(1<<t)-1)
            {
                if(lim[k]&&lim[k]-'a'+1!=j) continue;
                int c=(cnt[k]&1)?1:mod-1;
                dp[id[nt[k]]][j]=add(dp[id[nt[k]]][j],1ll*dp[i][j]*c%mod);
            }
        }
    }
    cout<<dp[idx][26]<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
//    freopen("in","r",stdin);
//    freopen("out","w",stdout);
    int T;
    cin>>T;
    rep(t,1,T) cout<<"Case #"<<t<<": ",work();
    return 0;
}