#include <bits/stdc++.h>

using namespace std;

char s[11];
int data[1100][11];
int n,T,m,k;
int num[1100];
int sum[1100];
int Get(int col,int bit)
{
    int numb = 0;

    int result = 0;
    while(bit)
    {
        if(bit %2)
        {
            result = result *2 + data[col][numb];
        }
        numb++;
        bit /=2;
    }
    return result;
}
int main()
{
    scanf("%d",&T);
    for(int Case = 1; Case <= T; Case ++)
    {
        scanf("%d %d %d",&n,&m,&k);
        for(int i = 0; i<n; i++)
        {
            scanf("%s",s);
            for(int j = 0; j<m; j++)
            {
                data[i][j] = s[j] == 'A'?1:0;
            }
        }
        int OutResult = 0;
        for(int i = 1; i<=((1<<m)-1); i++)
        {
            memset(num,0,sizeof(num));
            for(int j = 0; j<n; j++)
            {
                num[Get(j,i)]++;
            }
            sum[1024] = 0;
            for(int j = 1023; j >= 0; j--)
            {
                sum[j] = sum[j+1] + num[j];
            }
            int result = 0;
            for(int j = 0; j<1024; j++)
            {

                result = result+num[j]*sum[j+1];
            }
            if(result >=k)
                OutResult++;
        }
        printf("Case #%d: %d\n",Case,OutResult);

    }


    return 0;
}