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.util.*;

public class B {

public static void main(String[] args)

	{
			Scanner in = new Scanner(System.in);
			
			int T = Integer.parseInt(in.nextLine());
			
			for (int test = 0 ; test < T ; test ++)
			{

				String input = in.nextLine();
				String[] bIn = input.split(" ");
				
				int googlersNum = Integer.parseInt(bIn[0]);
				int suprisingMax = Integer.parseInt(bIn[1]);
				int requirement = Integer.parseInt(bIn[2]);
				
				int okay=0;
				int suprising=0;
				
				for (int run = 0 ; run < googlersNum ; run ++)
				{
			
					int S = Integer.parseInt(bIn[3+run]);

					int temp = S;
					boolean testCase = false,done=false;
			
		
					for (int i = 10 ; i >= 0 ; i--)
					{
						for (int j =  i ; j >= i-1 && j >= 0; j--)
						{
							for (int k = i ; k >= i-1  && k >= 0; k --)
							{
									temp = temp - k  - i - j;

									if (temp == 0) 
									{ 
									
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											okay++;
											done = true;
										}
									
									}
									temp = S;
							}
						}
					}	
				
					temp = S;
				
					if (!testCase && suprising < suprisingMax)
					{
						for (int i = 10 ; i >= 0 ; i--)
						{
							for (int j = i ; j >= i-2 && j >= 0 ; j--)
							{
								for (int k = i ; k >= i-2  && k >= 0 ; k--)
								{
									temp = temp - i - k - j;
									if (temp == 0) 
									{ 
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											testCase = true;
											suprising++;
											okay++;
											done = true;
										}
									
									}
									temp = S;

								}
							}
						}
					}
				}
				
				System.out.println("Case #"+(test+1)+": "+okay);
			}
					
			in.close();
	}
	
}
			
			