#include<iostream>
#include<cstdio>
#define N 26
#define M 184756
#define K 20
#define mod 10007
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
int T,n,m,length,l[N+1][N+1],r[N+1][N+1],dp[N+1][M+1],DP[N+1][M+1],tong[M+1],num[1<<K];
char c[N+1][N+1];
int main()
{
    int res;
    bool op;
    T=read();
    for (int i=1;i<=T;++i)
    {
	n=read(),m=read(),length=0;
	for (int j=0;j<(1<<(n+m));++j)
	    if (__builtin_popcount(j)==m)
		tong[++length]=j,num[j]=length;
	for (int j=0;j<=26;++j)
	{
	    for (int k=0;k<=n+m;++k) l[j][k]=0,r[j][k]=k;
	    for (int k=1;k<=length;++k) dp[j][k]=0;
	}
	for (int j=1;j<=n;++j)
	    for (int k=1;k<=m;++k)
	    {
		cin>>c[j][k];
		if (c[j][k]!='.')
		{
		    r[c[j][k]-'a'][n-j+k]=min(r[c[j][k]-'a'][n-j+k],k-1);
		    if (c[j][k]!='z') l[c[j][k]-'a'+1][n-j+k]=max(l[c[j][k]-'a'+1][n-j+k],k);
		}
	    }
	dp[0][length]=1;
	for (int j=1;j<=26;++j)
	{
	    for (int k=1;k<=n+m;++k)
		for (int t=1;t<=length;++t)
		    DP[k][t]=0;
	    for (int k=1;k<=length;++k) DP[1][k]=dp[j-1][k];
	    for (int k=2;k<=n+m;++k)
		for (int t=1;t<=length;++t)
		{
		    Adder(DP[k][t],DP[k-1][t]);
		    if (tong[t]&(1<<(k-1)))
		    {
			for (int w=k-1;w>=1;--w)
			{
			    if (!(tong[t]&(1<<(w-1)))) Adder(DP[k][num[tong[t]^(1<<(k-1))^(1<<(w-1))]],DP[k-1][t]);
			    else break;
			}
		    }
		}
	    for (int k=1;k<=length;++k)
	    {
		res=0,op=1;
		for (int t=1;t<=n+m;++t)
		{
		    res+=((tong[k]>>(t-1))&1);
		    if (res<l[j][t]||res>r[j][t]) op=0;
		}
		if (op) dp[j][k]=DP[n+m][k];
	    }
	}
	printf("Case #%d: %d\n",i,dp[26][1]);
    }
    return 0;
}