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

const int N = 15, M = 2e5, P = 1e4 + 7;

void inc(short &x, short y) { if ((x += y) >= P) x -= P;}

int T, n, m;
char g[N][N];
int pos[26][N];

vector<vector<int>> S;
int idx = 0;

vector<int> a;
void dfs(int k) {
	if (k > n) {
		S.push_back(a);
		return;
	}
	for (int i = a[k - 1]; ~i; --i) a[k] = i, dfs(k + 1);
}

int f[2][M], p[N][M];

int main() {
	cin >> T;
	for (int t = 1; t <= T; ++t) {
		cin >> n >> m;
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				cin >> g[i][j];
				if (g[i][j] >= 'a' && g[i][j] <= 'z') {
					pos[g[i][j] - 'a'][i] = max(pos[g[i][j] - 'a'][i], j);
				}
			}
		}
		
		a.resize(n + 1), a[0] = m;
		dfs(1);
		reverse(S.begin(), S.end());
		
		for (int i = 1; i <= n; ++i) {
			for (int j = 0, k = 0; j < S.size(); ++j) {
				vector<int> x = S[j];
				if (x[i - 1] >= x[i] + 1) {
					x[i]++;
					while (S[k] < x) ++k;
					p[i][j] = k;
				}
			}
		}
		
		memset(f, 0, sizeof f), f[0][0] = 1;
		for (int c = 0; c < 26; ++c) {
			for (int i = 1; i <= n; ++i) {
				for (int j = 0; j < S.size(); ++j) {
					vector<int> x = S[j];
					if (x[i - 1] >= x[i] + 1 && (g[i][x[i] + 1] == c + 'a' || g[i][x[i] + 1] == '.')) {
						f[c & 1][p[i][j]] += f[c & 1][j];
					}
				}
			}
			memcpy(f[(c & 1) ^ 1], f[c & 1], sizeof f[(c & 1) ^ 1]);
			
			for (int j = 0; j < S.size(); ++j) {
				vector<int> x = S[j];
				int flg = 1;
				for (int i = 1; i <= n; ++i) flg &= (pos[c][i] <= x[i]);
				if (!flg) f[(c & 1) ^ 1][j] = 0;
				else f[(c & 1) ^ 1][j] %= P;
			}
		}
		
		cout << "Case #" << t << ": " << f[0][S.size() - 1] << endl;

		vector<vector<int>>().swap(S);
		idx = 0;
		memset(pos, 0, sizeof pos);
	}

	return 0;
}

/*
1
2 2
ad
c.
*/