/*
 * 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);
        }


    }
}

/**
 *
 *
 * @Author      :Yasith Maduranga(Merlin)
 * @version     :1.0
 * @Date        :2012/4/14
 * @Copyright GSharp Lab, All Rights Reserved....
 */
import java.io.*;
import java.util.*;

class dancinwith {
	public static void main(String args[]){
		try{
	    	BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
	    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));

	    	int noOfCases = Integer.parseInt(br.readLine());

	    	for(int i=0;i<noOfCases;i++){
				String tmp[]=br.readLine().split(" ");
				int noOfGooglers=Integer.parseInt(tmp[0]);
				int noOfSuprisingScores=Integer.parseInt(tmp[1]);
				int bestResult=Integer.parseInt(tmp[2]);
				int maximumNo=0;

				for(int j=3;j<tmp.length;j++){
					int marks=Integer.parseInt(tmp[j]);
					int mod=marks/3;
					switch(marks%3){
						case 0:{
							if(mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 1:{
							if(mod>=bestResult || mod+1>=bestResult ){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 2:{
							if(mod+1>=bestResult || mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+2>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
					}
				}


				out.println("Case #"+(i+1)+": "+maximumNo);
	    	}



	    	out.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	    	System.exit(0);
	}
}
