#include<iostream>
#include<cstdio>
#include<fstream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define MAXN 102
using namespace std;

int T;
int N,K,L;
char s[MAXN][MAXN];
int sub[MAXN];
int dp[MAXN][MAXN];

int MIN(int x,int y)
{
    return x<y?x:y;
}

void ready()
{
    for(int i=1;i<=N;i++)
    {
            int len=strlen(s[i]);
            for(int center=0;center<len;center++)
            {
                for(int j=0;center-j>=0 && center+j<len;j++)
                {
                    if(s[i][center-j]!=s[i][center+j])break;
                    sub[2*j+1]++;
                }
            }
            
            for(int d=0;d<len-1;d++)
               if(s[i][d]==s[i][d+1])
               {
                       for(int k=0;d-k>=0 && d+1+k<len;k++)
                       {
                         if(s[i][d-k]!=s[i][d+1+k])break;
                         sub[2*k+2]++;
                    }
                   }
    }
}
    

void solve()
{
    scanf("%d",&T);
    
    while(T--)
    {
        memset(s,0,sizeof(s));
        memset(sub,0,sizeof(sub));
        scanf("%d%d%d",&N,&K,&L);
        
        for(int i=1;i<=N;i++)scanf("%s",s[i]);
        
        ready();
        
        if(K>L)printf("False\n");
        
        else
        {
            memset(dp,0,sizeof(dp));
            dp[0][0]=1;
            
            for(int i=1;i<=L;i++)
             for(int j=K;j>0;j--)
              for(int k=L;k>0;k--)
               for(int p=1;p<=j && p<=L/i && p<=sub[i];p++)
               {
                      if(k>=i*p)
                        if(dp[j-p][k-i*p])dp[j][k]=1;
                   }
            printf("%s\n",dp[K][L]?"True":"False");
        }
        
        
    }
}

int main()
{
    //freopen("1002.in","r",stdin);
    //freopen("1002.out","w",stdout);
    
    solve();

    return 0;
}