#include <bits/stdc++.h>

 using namespace std;

 const int maxm = ;

 const int maxn = ;

 const int inf = 0x3f3f3f3f;

 int n, m, k;

 int nx,ny;

 int G[maxn][maxn];

 int linker[maxn],lx[maxn],ly[maxn];

 int slack[maxn];

 bool visx[maxn],visy[maxn];

 char ans[maxm];

 char stu[maxm];

 bool dfs(int x) {

   visx[x] = true;

   for(int y = ; y < ny; y++) {

     if(visy[y])continue;

     int tmp = lx[x] + ly[y] - G[x][y];

     if(tmp == ) {

       visy[y] = true;

       if(linker[y] == - || dfs(linker[y])) {

         linker[y] = x;

         return true;

       }

     }

     else if(slack[y] > tmp)

       slack[y] = tmp;

   }

   return false;

 }

 int km() {

   memset(linker,-,sizeof(linker));

   memset(ly,,sizeof(ly));

   for(int i = ;i < nx;i++) {

     lx[i] = -inf;

     for(int j = ;j < ny;j++)

       if(G[i][j] > lx[i])

         lx[i] = G[i][j];

   }

   for(int x = ;x < nx;x++) {

     for(int i = ;i < ny;i++)

       slack[i] = inf;

     while(true) {

       memset(visx,false,sizeof(visx));

       memset(visy,false,sizeof(visy));

       if(dfs(x))break;

       int d = inf;

       for(int i = ;i < ny;i++)

         if(!visy[i] && d > slack[i])

           d = slack[i];

       for(int i = ;i < nx;i++)

         if(visx[i])

           lx[i] -= d;

       for(int i = ;i < ny;i++) {

         if(visy[i])ly[i] += d;

         else slack[i] -= d;

       }

     }

   }

   int res = ;

   for(int i = ;i < ny;i++)

     if(linker[i] != -)

       res += G[linker[i]][i];

   return res;

 }

 int main() {

   // freopen("in", "r", stdin);

   int T;

   scanf("%d", &T);

   nx = ny = ;

   while(T--) {

   scanf("%d%d%d",&n,&k,&m);

   for(int i = ; i < n; i++) {

     cin >> ans[i];

   }

   for(int _ = ; _ < m; _++) {

     for(int i = ; i < n; i++) {

     cin >> stu[i];

     }

     memset(G, , sizeof(G));

     for(int i = ; i < n; i++) {

     G[stu[i]-'A'][ans[i]-'A']++;

     }

     printf("%.4lf\n", (double)km()/(double)n);

   }

   }

   return ;

 }