#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int maxn=1e5+10;
const int maxm=5e4+10;
const int mod=1000003;
const ull base1=233;
const ull base2=19260817;
const int maxxn=0x7fffffff;
const int minxn=-0x7fffffff;
const db inf=1e13;
const db eps=1e-8;
inline ll read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
int t,n,k;
char s[105][105];
int sit[105][30];
int dp[105][1<<15];
int ans=0;
int main(){
    t=read();
    while(t--){
        ans=0;
        n=read(),k=read();
        memset(sit,0,sizeof(sit));
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++){
            scanf("%s",s[i]);
        }
        int len=strlen(s[1]);
        for(int i=0;i<len;i++){
            for(char c='a';c<='z';c++){
                for(int j=1;j<=n;j++){
                    if(s[j][i]==c||s[j][i]=='?'){
                        sit[i][c-'a']|=(1<<(j-1));
                    }
                }
            }
        }
        dp[0][(1<<n)-1]=1;
        for(int i=0;i<len;i++){
            for(int j=0;j<(1<<n);j++){
                if(dp[i][j]){
                    for(char c='a';c<='z';c++){
                        dp[i+1][sit[i][c-'a']&j]=(dp[i+1][sit[i][c-'a']&j]+dp[i][j])%mod;
                    }
                }
            }
        }
        for(int i=0;i<(1<<n);i++){
            int cnt=0;
            for(int j=1;j<(1<<n);j<<=1){
                cnt+=((i&j))?1:0;
            }
            if(cnt==k){
                ans=(ans+dp[len][i])%mod;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}