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;

public class Dance
{

    public static void main(String args[]) throws Exception
    {
        int N,S,T,p,ti;
        
        Scanner in = new Scanner( System.in );
        T = in.nextInt();
        int pos = 1;
        while( pos <= T )
        {
        
            N = in.nextInt(); // Number of idiots
            S = in.nextInt(); // Number of times a judge was biased
            p = in.nextInt(); // The best result we are looking for

            int count = 0;
            
            int test_1 = Math.max(p * 3 - 2 , p );
            int test_2 = Math.max( test_1 - 2 , p);
            
            for( int i = 0 ; i < N ;i++)
            {
                ti = in.nextInt();

                if( ti >= test_1 )
                {
                    count++;
                }else if( S > 0 && ti >= test_2 )
                {
                    S--;
                    count++;
                }
            }
            
            System.out.println("Case #" + pos + ": " + count);
            
            pos++;
        }
    }
}