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

public class B {
	public static int solve(int T, int P) {
		int[] score = new int[3];
		
		score[0] = T/3;
		score[1] = (T-score[0]) / 2;
		score[2] = (T-score[0]-score[1]);
		
		Arrays.sort(score);
		int dif = score[2] - score[0];
		
		if (dif > 2) {
			System.err.println("ERROR");
			System.exit(-1);
		}
		//System.err.println("BEFORE ARRANGE NUM "+T+": "+score[0]+" "+score[1]+" "+score[2]);
		
		if (score[2] >= P) {
			if (dif == 2) return 1;
			else return 0;
		}
		
		// try to make it interesting
		if (dif < 2) {
			score[2]++;
			score[1]--;
			Arrays.sort(score);
			dif = score[2] - score[0];
		}
		
		if (score[0] < 0 || score[0] > 10 || score[1] < 0 || score[1] > 10 || score[2] < 0 || score[2] > 10 || dif > 2) {
			return -1;
		}
		
		//System.err.println("AFTER ARRANGE NUM "+T+": "+score[0]+" "+score[1]+" "+score[2]);
		
		if (score[2] >= P) {
			if (dif == 2) return 1;
			else return 0;
		}
		
		return -1;
	}
	
	public static void main(String[] args) throws Exception{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int N, S, P, used, can;
		
		for(int caseNo = 1;caseNo <= T; caseNo++) {
			N = in.nextInt();
			S = in.nextInt();
			P = in.nextInt();
			used = 0;
			can = 0;
			
			for(int i=0;i<N;i++) {
				int ret = solve(in.nextInt(), P);
				
				if (ret == 0) { // didint need surprise
					can++;
				} else if (ret == 1 && used < S) { // need surprise
					used++;
					can++;
				}
			}
			System.out.println("Case #"+caseNo+": "+can);
			
		}
	}
}