package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
import java.io.*;
import java.util.Scanner;

public class dancingWithTheGooglers
{
  
  public static void main (String[] args) throws IOException
  {
    
    File file = new File("in.txt");
    Scanner input = null;
    try
    {
      input = new Scanner(file);
    }
    catch(IOException e){}
    
    int T = input.nextInt();
    int N, S, p, t[];
    int scoreDiv, scoreMod;
    int score[] = new int[3];
    int solution;
    for (int i = 0; i < T; i++)
    {
      N = input.nextInt();
      S = input.nextInt();
      p = input.nextInt();
      t = new int[N];
      solution = 0;
      
      for (int j = 0; j < N; j++)
      {
        t[j] = input.nextInt();
        scoreDiv = t[j] / 3;
        scoreMod = t[j] % 3;
        
        score[0] = scoreDiv;
        score[1] = scoreDiv;
        score[2] = scoreDiv;
        for (int k = 0; k < scoreMod; k++)
        {
          score[k]++;
        }
        if(score[0] >= p || score[1] >= p || score[2] >= p)
          solution++;
        else
        {
          if (S > 0)
          {
            if (scoreMod == 0 || scoreMod == 2)
            {
              if (score[1] > 0)
              {
                score[0]++;
                score[1]--;
              }
              if (score[0] >= p)
              {
                solution++;
                S--;
              }
            }
            else if (scoreMod == 1)
            {
              if (score[2] > 0)
              {
                score[1]++;
                score[2]--;
              }
              if (score[0] >= p)
              {
                solution++;
                S--;
              }
            }
          }
        }
      }
      
      System.out.println("Case #" + (i + 1) + ": " + solution);
    }
    
  }
  
}