import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class googleDancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		ArrayList<Integer> lstInt = new ArrayList<Integer>();
		boolean error_ni = false;
		try{
			 FileReader fr=new FileReader("B-large.in"); 
		
			 BufferedReader  br = new BufferedReader (fr);
		     int numCases = Integer.parseInt(br.readLine());
		     BufferedWriter bw = new BufferedWriter(new FileWriter(new File("solution.txt")));
		     int i;
		     

		     for(i=1; i<=numCases; i++ ){
		    	 String linea = new String(br.readLine());
		    	 StringTokenizer palabraSeparation = new StringTokenizer(linea);
		    	 lstInt.clear();
		    	 int N = Integer.parseInt(palabraSeparation.nextToken());
		    	 int S = Integer.parseInt(palabraSeparation.nextToken());
		    	 int p = Integer.parseInt(palabraSeparation.nextToken());
		    	 int solution = 0;
		    	 int surprising = 0;
		    	 while(palabraSeparation.hasMoreTokens() != false){
		    		 int num_i = Integer.parseInt(palabraSeparation.nextToken());
		    		 lstInt.add(num_i);
		    		 /*if (num_i > 30)
		    			 error_ni = true;*/
		    	 }
		    
		    	
		    
		    	 if ((S>=0  && S <= N) && (p>= 0 && p <= 10) && error_ni == false){
		    		 if (p==0){
		    			 solution = lstInt.size();
		    		
		    		 }
		    		 else
				    		 for (int j=0; j<lstInt.size(); j++){ 
				    			  
				    			 if (p == 1  ){
				    				 if (lstInt.get(j)>0) solution++;
				    			 }	  
				    			 else if (p*3 <= lstInt.get(j) && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-2 <= lstInt.get(j) && p>=1 && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-4 <= lstInt.get(j) && lstInt.get(j) >= 2 && lstInt.get(j)<=28){
				    				 surprising++;
				    			 }
				    			 	 
				    		 }
				    		 if(S >= surprising)
			    				 solution +=surprising;
					    	 else if(S < surprising )
					    		 solution +=S;
				    	 }
				    	 
				    	 
				    	 //System.out.println("Case #" + i+": "+solution);
				    	bw.write("Case #" + i+": "+solution);
				        bw.newLine();
				         
				     }
		     
		 bw.close();
		}catch (Exception e){//Catch exception if any
		    	  System.err.println("Error: " + e.getMessage());
		}
			  
		


	}

}
