#include <bits/stdc++.h>

using namespace std;

using u32=unsigned int;
using i64=long long;
using u64=unsigned long long;
using db=double;
using vi=vector<int>;
using pii=pair<int,int>;

template<typename T>
T read(){
    T x=0,f=0;char ch=getchar();
    while(!isdigit(ch)) f|=(ch=='-'),ch=getchar();
    while(isdigit(ch)) x=x*10+(ch-'0'),ch=getchar();
    return f?-x:x;
}

#define rdi read<int>
#define rdi64 read<i64>
#define fi first
#define se second
#define pb push_back

const int N=10,N2=N*2,S=2e5+10,C=26,MOD=10007;

int popc[(1<<N2)|10],kth[(1<<N2)|10][N];
void init(int mx){
    popc[0]=0;
    for(int i=1;i<(1<<mx);i++){
        popc[i]=popc[i>>1]+(i&1);
        kth[i][0]=__builtin_ctz(i);
        for(int j=1;j<min(popc[i],N);j++)
            kth[i][j]=kth[i&(i-1)][j-1];
    }
}

template<typename T>
void inc(T &a,T b){
    if((a+=b)>=MOD) a-=MOD;
}

int n,m;
char a[N][N2];
int f[2][N][S],id[(1<<N2)|10];
void solve(int tid){
    n=rdi(),m=rdi();
    for(int i=0;i<n;i++)
        scanf("%s",a[i]);

    vi st;
    for(int i=0;i<(1<<(n+m));i++)
        if(popc[i]==n) id[i]=st.size(),st.pb(i);

    memset(f,0,sizeof(f));
    f[0][0][id[((1<<n)-1)<<m]]=1;
    for(int i=0,nw=0;i<C;i++,nw^=1){
        for(int j=0;j<n;j++){
            for(int u=0;u<st.size();u++){
                int s=st[u],v=f[nw][j][u]%MOD;
                if(!v) continue;
                int p=kth[s][j],mi=(j?kth[s][j-1]+1:0);
                for(int k=p,fl=1;k>=mi&&fl;k--){
                    int n_s=id[s^(1<<p)^(1<<k)];
                    if(j!=n-1) f[nw][j+1][n_s]+=v;
                    else f[nw^1][0][n_s]+=v;
                    char ch=a[j][m-(k-j)];
                    fl&=(ch=='.'||ch==i+'a');
                }
                f[nw][j][u]=0;
            }
        }
    }
    int ans=f[C&1][0][id[(1<<n)-1]]%MOD;
    printf("Case #%d: %d\n",tid,ans);
}

int main(){
#ifdef LOCAL
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif
    init(N2);
    int T=rdi();
    for(int i=1;i<=T;i++) solve(i);
    return 0;
}