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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;






public class B { 

	static String inner = "input.in";
	static Scanner scan;
	public static void main (String[]args) throws IOException
	{
		File f = new File (inner);
		File out = new File("output.out");
		FileWriter wr; 
		wr = new FileWriter(out); 
		scan = new Scanner(f); 
		int test = scan.nextInt();
		scan.nextLine();
		for(int i = 0 ; i < test ; i++)
		{
			Scanner sc = new Scanner (scan.nextLine());
			int n = sc.nextInt();
			int surp = sc.nextInt();
			int p = sc.nextInt();
			int [] ggs = new int[n];
			for(int j = 0 ;j < n ; j++)
				ggs[j] = sc.nextInt();  
			String ret = "Case #"+ (i+1)+": ";
			 
			int zero =0;
			int one = 0;
			int twolow = 0;
			int lowhigh = 0;
			int high  = 0;
			int top = 0;
			for(int j = 0 ;j < n ; j++)
			{
				if(ggs[j] == 0)
					zero++;
				else if(ggs[j]<2)
					one++;
				else if(ggs[j]< 3*p-4)
					twolow++;
				else if(ggs[j] < 3*p-2)
					lowhigh++;
				else if(ggs[j]< 29)
					high++;
				else
					top++; 
			}
			if(p == 0)
				ret += ""+n;
			else if(p == 1 )
				ret += ""+ (n-zero);
			else
				ret += (Math.min(surp,lowhigh ) + high + top)+"";  
			wr.write(ret+"\n");
			
		}
		
		
		
		 
		 wr.flush();
	}
}
