#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define MAX 1005
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;

int b[(1<<10)+5];
char s[MAX][15];
ll dp[MAX][(1<<10)+5];

int main()
{
    int t,tt=0,n,m,kk,i,j,k;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d",&n,&m,&kk);
        for(i=1;i<=n;i++){
            scanf(" %s",s[i]);
        }
        memset(dp,0,sizeof(dp));
        for(i=1;i<(1<<m);i++){
            memset(b,0,sizeof(b));
            for(j=1;j<=n;j++){
                int S=0;
                for(k=0;k<m;k++){
                    if((i&(1<<k))&&s[j][k]==‘A‘){
                        S|=1<<k;
                    }
                }
                b[S]++;
                dp[j][i]=dp[j-1][i]+j-b[S];
            }
        }
        ll ans=0;
        for(i=1;i<(1<<m);i++){
            if(dp[n][i]>=kk) ans++;
        }
        printf("Case #%d: %I64d\n",++tt,ans);
    }
    return 0;
}