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.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author joshuahm
 */
public class codejamB {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("B-small-attempt3.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("B-small-attempt3.out");
        PrintWriter out = new PrintWriter(outFile);
        int T= in.nextInt();
        for(int k=0;k<T;k++)
        {
            int N= in.nextInt();
            int S= in.nextInt();
            int p= in.nextInt();
            int[] total= new int[N];
            for(int i=0;i<N;i++)
                total[i]= in.nextInt();
            int possible=0;
            int surprising=0;
            for(int i=0;i<N;i++)
            {
                if(total[i]>3*p-3)
                    possible++;
                else if(total[i]>Math.max(3*p-5,0))
                    surprising++;
            }
            out.println("Case #"+ (k+1) +": "  + (possible + Math.min(surprising, S)));
        }
        in.close();
        out.close();
    }
}
