#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vint;
int read() {
	int a = 0, b = 0; char c = getchar();
	while (c < '0' || c > '9') b ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') a = a * 10 - 48 + c, c = getchar();
	return b ? -a : a;
}

const int mod = 10007, K = 1 << 20;

int n, m, ans;
char s[12][12];
int dp[2][K], popc[K];
int cu[1024], lb[1024];

int sol(){
	n = read(), m = read(), ans = 0;
	for (int i = 0; i < n; i++) scanf("%s", s[i]);
	for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if('a' <= s[i][j] && s[i][j] <= 'z') s[i][j] -= 'a';
	int u = n + m, o = 1 << u;
	memset(dp, 0, sizeof dp);
	static vint q;
	q.clear(); for (int j = 0; j < o; ++j) if (popc[j] == m) q.push_back(j);
	int *A = dp[0], *B = dp[1];
	A[(1 << m) - 1] = 1;
	for (int i = 0; i < 26; i++) {
		memcpy(B, A, o << 2);
		for (int j : q) {
			int c[10] = {}, ct = 0, re = 0, ag = 0;
			int rr = 0;
			for (int k = 1; k < u; k++) {
				re += (j >> k - 1) & 1;
				if (!((j >> k - 1) & 1) && ((j >> k) & 1)) {
					int q = m - re - 1;
					int p = k - re - 1;
					if (s[p][q] != '.' && s[p][q] != i) continue;
					if (s[p][q] == i) { rr ^= ((1 << k) | (1 << k - 1)); continue; }
					c[ct++] = (1 << k) | (1 << k - 1);
				}
			}
			int p = 1 << ct;
			for (int k = 1; k < p; k++) {
				if (k == (k & -k)) cu[k] = c[lb[k]];
				else cu[k] = cu[k & k - 1] ^ cu[k & -k];
				int q = B[cu[k] ^ j ^ rr];
				B[j] += (popc[k] & 1) ? q : mod - q;
			}
			B[j] %= mod;
		}
		swap(A, B);
	}
	return A[(1 << m) - 1 << n];
}

int main() {
	for (int i = 1; i < K; ++i) popc[i] = popc[i & i - 1] + 1;
	for (int i = 2; i < 1024; i++) lb[i] = lb[i >> 1] + 1;
	int T = read();
	for (int i = 1; i <= T; i++) {
		printf("Case #%d: %d\n", i, sol());
	}
	return 0;
}