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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) throws FileNotFoundException {
		int cases;
		
		Scanner scan = new Scanner(new File("B.small.in"));
		cases = scan.nextInt();
		
		for (int i = 1; i <= cases; i++) {
			int googlers = scan.nextInt();
			int surprising = scan.nextInt();
			int p = scan.nextInt();
			int totals[] = new int[googlers];
			
			for (int j = 0; j < googlers; j++) {
				totals[j] = scan.nextInt();
			}
			
			int isSurprising = 0;
			int possible = 0;
			
			for (int j = 0; j < googlers; j++) {
				if (p - (totals[j] / 3) <= 0) {
					possible++;
				} else if (p - (totals[j] / 3) == 1) { /* avg = 5, p = 6 */
					if (totals[j] % 3 == 0 && totals[j] > 0) {
						possible++; /* 0 */
						isSurprising++;
					} else if (totals[j] % 3 == 1) {
						possible++;
					} else if (totals[j] % 3 == 2) {
						possible++;
					}
				} else if (p - (totals[j] / 3) == 2) {
					if (totals[j] % 3 == 0) {
						
					} else if (totals[j] % 3 == 1) {
						
					} else if (totals[j] % 3 == 2) {
						possible++;
						isSurprising++;
					}
				}
			}
			
			if (isSurprising > surprising) {
				possible -= isSurprising - surprising;
			}
			
			System.out.println("Case #" + i + ": " + possible);
		}
	}

}
