#include <bits/stdc++.h>
using namespace std;
const int N = 1.1e6 + 10, mod = 1e4 + 7;
int dp[2][N];
int n, m;
char c[30][30];
vector<int> v;
int tmp[N];
int sol()
{
    scanf("%d%d",&n,&m);getchar();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
            scanf("%c",&c[i][j]);
        getchar();
    }
    memset(dp,0,sizeof dp);
    dp[0][(1 << m) - 1] = 1;
    for (int i = 0; i < 26; i++)
    {
        int ri=(i&1),ti=(i&1)^1;
        for (int S = 0; S < (1 << n + m); S++)
        {
            if (__builtin_popcount(S) != m)
                continue;
            dp[ti][S] = dp[ri][S];
            v.clear();
            int x = 0, y = m;
            for (int j = 0; j < n + m - 1; j++)
            {
                ((S >> j) & 1) ? y-- : x++;
                if (((S >> j) & 3) == 2)
                {
                    if (c[x][y] == '.' or c[x][y] == i + 'a')
                        v.push_back(3 << j);
                }
            }
            int sz = v.size();
            for (int j = 1; j < (1 << sz); j++)
            {
                tmp[j] = (j == (j & (-j)) ? v[__builtin_ctz(j)] : tmp[j & (-j)] ^ tmp[j ^ (j & (-j))]);
                int op = __builtin_popcount(j) & 1;
                dp[ti][S]+=(op?dp[ti][S^tmp[j]]:mod-dp[ti][S^tmp[j]]);
            }dp[ti][S]%=mod;
        }
    }
    return dp[0][((1 << m) - 1) << n];
}
int main()
{
    int T;
    scanf("%d",&T);
    for (int i = 1; i <= T; i++)
    {
        printf("Case #%d: %d\n", i, sol());
    }
    return 0;
}