#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();
    while (T--)
    {
	n=read(),m=read(),length=0;
	for (int i=0;i<(1<<(n+m));++i)
	    if (__builtin_popcount(i)==m)
		tong[++length]=i,num[i]=length;
	for (int i=0;i<=26;++i)
	{
	    for (int j=0;j<=n+m;++j) l[i][j]=0,r[i][j]=j;
	    for (int j=1;j<=length;++j) dp[i][j]=0;
	}
	for (int i=1;i<=n;++i)
	    for (int j=1;j<=m;++j)
	    {
		cin>>c[i][j];
		if (c[i][j]!='.')
		{
		    r[c[i][j]-'a'][n-i+j]=min(r[c[i][j]-'a'][n-i+j],j-1);
		    if (c[i][j]!='z') l[c[i][j]-'a'+1][n-i+j]=max(l[c[i][j]-'a'+1][n-i+j],j);
		}
	    }
	dp[0][length]=1;
	for (int i=1;i<=26;++i)
	{
	    for (int j=1;j<=n+m;++j)
		for (int k=1;k<=length;++k)
		    DP[j][k]=0;
	    for (int j=1;j<=length;++j) DP[1][j]=dp[i-1][j];
	    for (int j=2;j<=n+m;++j)
		for (int k=1;k<=length;++k)
		{
		    Adder(DP[j][k],DP[j-1][k]);
		    if (tong[k]&(1<<(j-1)))
		    {
			for (int t=j-1;t>=1;--t)
			{
			    if (!(tong[k]&(1<<(t-1)))) Adder(DP[j][num[tong[k]^(1<<(j-1))^(1<<(t-1))]],DP[j-1][k]);
			    else break;
			}
		    }
		}
	    for (int j=1;j<=length;++j)
	    {
		res=0,op=1;
		for (int k=1;k<=n+m;++k)
		{
		    res+=((tong[j]>>(k-1))&1);
		    if (res<l[i][k]||res>r[i][k]) op=0;
		}
		if (op) dp[i][j]=DP[n+m][j];
	    }
	}
	printf("%d\n",dp[26][1]);
    }
    return 0;
}