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.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;

public class B {
	int[] mp=new int[33], sp=new int[33];

	void start() {
		for (int a=0; a<11; a++)
			for (int b=a; b<11 && b<a+3; b++)
				for (int c=b; c<11 && c<a+3; c++) {
					int s=a+b+c;
					if (c-a<2) mp[s]=Math.max(mp[s],c);
					else sp[s]=Math.max(sp[s],c);
				}
	
		Scanner sc=new Scanner(System.in);
		int nt=sc.nextInt();
		for (int t=1; t<=nt; t++) {
			int n=sc.nextInt(), surp=sc.nextInt(), top=sc.nextInt(), score, re=0;
			for (int i=0; i<n; i++) {
				score=sc.nextInt();
				if (mp[score]>=top) re++;
				else if (sp[score]>=top && surp>0) {
					surp--;
					re++;
				}
			}
			System.out.printf("Case #%d: %d\n", t, re);
		}
	}

	public static void main(String[] args) throws Exception {
		new B().start();
	}
}