/*
 * 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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B {
	Map<String, String> mapLenguaje;

	public static void main(String arg[]) {
		try {
			StringBuffer line;
			
			File file = new File("C:/Documents and Settings/jjmamby/Mis documentos/Descargas/B-small-attempt1.in");
			int T = 0, N = 0, S = 0, maxP, t, bestResult, p;
			StringBuilder output = new StringBuilder();
			if (file.exists()) {
				BufferedReader input = new BufferedReader(new FileReader(file));
				
				T = Integer.valueOf((input.readLine()));
				for (int i = 0; i < T; i++) {
					line = new StringBuffer(input.readLine());
					StringTokenizer st = new StringTokenizer(line.toString(), " ");
					N = Integer.valueOf(st.nextToken());
					S = Integer.valueOf(st.nextToken());
					maxP = Integer.valueOf(st.nextToken());
					p = 0;
					for(int j = 0; j < N; j++){
						t = Integer.valueOf(st.nextToken());
						int aux1 = t / 3 ;
						bestResult = aux1;
						int aux2 = (t - aux1) / 2 ;
						
						if(aux2>bestResult){
							bestResult = aux2;
						}
						int aux3 = (t - aux1 - aux2) ;
						if(aux3>bestResult){
							bestResult = aux3;
						}
												
						if(maxP<=aux3){
							p++;
						}else if (t > 2 && t < 28){
							aux2--;
							aux3++;
							if(maxP<=aux3&& S>0 ){
								S--;
								p++;
							}
						}
					}
					output.append("Case #");
			    	output.append((i+1));
			    	output.append(": ");
			    	output.append(p);
			    	output.append("\n");
				}
				System.out.println(output.toString());
			}else{
				output.append("No hay Archivo");
			}
				
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
