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

public class DancingWithTheGooglers {

    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));    
    private static Scanner sc = new Scanner(br);

    public static void main ( String [] args ) throws IOException
    {
	int N = Integer.parseInt(br.readLine());

	for(int i = 0;i < N; i++) {
	    System.out.print("Case #" + (i+1) + ": ");
	    new DancingWithTheGooglers().cal();
	}
    }



    private void cal() throws IOException 
    {
    	int ret = 0;
    	
    	int number = sc.nextInt();
    	int[] numberArray = new int[number];
    	
    	int surprising = sc.nextInt();
    	int p = sc.nextInt();
    	
    	
    	int sDeadLine = p*3-4;
    	int deadLine = p*3-2;
    	if (p == 0){
    		sDeadLine = 100;
    		deadLine = 0;
    	}
    	if (p == 1){
    		sDeadLine = 100;
    		deadLine = 1;
    	}
    	
    	boolean[] okay = new boolean[number];
    	boolean[] sOkay = new boolean[number];

    	int okayCounter = 0, sOkayCounter = 0;
    	
    	
    	for(int i = 0; i < number; i++){
    		numberArray[i] = sc.nextInt();
    		if (numberArray[i] >= deadLine){
    			okay[i] = true; okayCounter++;
    			sOkay[i] = true; sOkayCounter++;
    		} else if( numberArray[i] >= sDeadLine ){
    			okay[i] = false;
    			sOkay[i] = true; sOkayCounter++;
    		} else {
    			okay[i] = false;	
    			sOkay[i] = false;
    		}
    	}
    	
    	ret = okayCounter;
    	ret += (sOkayCounter - okayCounter) > surprising? surprising : (sOkayCounter - okayCounter);   
    		
    	System.out.println(ret);
    	

    }

}


