import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.util.Scanner;
import java.io.File;

public class ScoreAnalyzer
 {
 	
 	public void analyzeInputFile(String fileName) throws Exception
 	 {
	   Scanner fileScanner = new Scanner (new File (fileName) ); 	
 	   
 	   String line;
 	   
 	   line = fileScanner.nextLine();
 	   
 	   int numberOfTestCases = Integer.parseInt(line.trim());
 	   
 	   int N,S,p;
 	   
 	   for(int i = 1; i<= numberOfTestCases ; i++)
 	    { 
 	       line = fileScanner.nextLine();	
 	       	 	
 	       Scanner lineScanner = new Scanner(line);
 	       
 	       N = Integer.parseInt(lineScanner.next().trim());
 	       S = Integer.parseInt(lineScanner.next().trim());
 	       p = Integer.parseInt(lineScanner.next().trim());
 	       
 	       // System.out.println("N= "+N+ " S = "+S + " p = "+p); 
 	       
 	       int noSurpriseLowerLimitScore;
 	       int surpriseLowerLimitScore;
 	       int surpriseHigherLimitScore;
 	       
 	       noSurpriseLowerLimitScore = 3*p - 2;
 	       surpriseLowerLimitScore   = 3*p - 4;
 	       surpriseHigherLimitScore  = 3*p - 3;
 	       
 	      // System.out.println("3p-2 = "+noSurpriseLowerLimitScore);
 	      // System.out.println("3p-4 = "+surpriseLowerLimitScore);
 	      // System.out.println("3p-3 = "+surpriseHigherLimitScore);
 	       
 	       
 	       int googlersWithBestResultOfAtLeastP = 0;
 	       int numberOfSurpriseScoresLeft = S;
 	       
 	       for(int j=1; j<=N ; j++)
 	        {
 	          int googlerScore = Integer.parseInt(lineScanner.next().trim());
 	          
 	          if(googlerScore >= p)
 	          {
 	          
 	           //  System.out.println("googlerScore = "+googlerScore+" ");
 	          
 	             if(googlerScore >= noSurpriseLowerLimitScore) 
 	              {
 	           	    googlersWithBestResultOfAtLeastP++;
 	           	    continue;
 	              }
 	           
 	             if(numberOfSurpriseScoresLeft > 0 )
 	              {
 	                if(googlerScore >= surpriseLowerLimitScore && googlerScore <= surpriseHigherLimitScore) 
 	                 {
 	              	   googlersWithBestResultOfAtLeastP++;
 	              	   numberOfSurpriseScoresLeft--;
 	                 } 	
 	              } 
 	           }
 	         } 
 	       
 	       System.out.println("Case #"+i+": "+googlersWithBestResultOfAtLeastP);
 	    }
 	 }
 	
 	
 	
    public static void main(String[] args) throws Exception
     {
     	ScoreAnalyzer SA = new ScoreAnalyzer();
     	String inputFile = "B-small-attempt0.in";
     	
     	SA.analyzeInputFile(inputFile);
     }	
 }