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

public class core {
	public static void main(String[] argv) throws Exception {
	
		String inputFile = argv[0];
		Scanner scan = null;
		FileReader fR = null;
		BufferedReader bR = null;

		int T;
		
		
		try{
			
			fR = new FileReader(inputFile);
			bR = new BufferedReader(fR);

			
			
			T = Integer.parseInt(bR.readLine());
			
			for(int i = 0; i <= T; i++){
				
				String[] temp = (bR.readLine()).split(" ");
				int[] input = new int[temp.length];
				for(int j =0; j < temp.length; j++){
					input[j] = Integer.parseInt(temp[j]);
				
				}
				
				int N = input[0];
				int S = input[1];
				int p = input[2];
				int[] division = new int[N];
				int[] remainder = new int[N];
				int out=0;
				
				
				for(int k = 3; k < input.length; k++){
					
					division[k-3] = input[k]/3;
					remainder[k-3] = input[k]-(division[k-3]*3);
					//System.out.println("" + division[k-3] + " : " + remainder[k-3] );
				}
				
				//System.out.println();
				
				for(int l = 0; l < division.length; l++){
					if(division[l]>=p){
						out++;
						//System.out.println("Did " + l);
					} else if ((division[l] == (p-1)) && (remainder[l]>0) ){
						out++;
						//System.out.println("Did 1 " + l);
					} else if ((division[l] == (p-2)) && (remainder[l]==2) && S > 0){
						out++;
						S--;
						//System.out.println("Did 2 " + l);
					} else if (division[l] == p-1 && remainder[l] == 0 && S > 0 && division[l] > 0){
						out++;
						S--;
						//System.out.println("Did 3 " + l);
					} 
						
				}
				
				int caseIndex = i+1;
				System.out.println("Case #" + caseIndex + ": " + out);
			
			}
			
		} catch(Exception e){}
	}
}
