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


    }
}


public class caseHandler {

	int N;
	int S;
	int P;
	
	int bestNum;
	
	int[] scores;
	
	public caseHandler(int N, int S, int P, int[] scores){
		this.N = N;
		this.S = S;
		this.P = P;
		this.scores = scores;
		this.bestNum = 0;
	}
	
	public int solveCase(){
		loopCase(scores[0], 0, 0, 0);
		return bestNum;
	}
	
	private void loopCase(int score, int currN, int Scount, int pNumCount){
		int currSCount = Scount;
		int currpNumCount = pNumCount;
		
		int aproxMinScore = score/3 - 1;
		if (aproxMinScore < 0) aproxMinScore = 0;
		for(int i=aproxMinScore;i<=10;i++){
			for(int j=aproxMinScore;j<=10;j++){
				if(Math.abs(i-j)>2) continue;
				for(int k=aproxMinScore;k<=10;k++){
					int min = Math.min(Math.min(i, j), k);
					if(Math.abs(min-i)>2 || Math.abs(min-j)>2 || Math.abs(min-k)>2) continue;
					if(i+j+k == score){
						int s = 0;
						int p = 0;
						if(Math.abs(i-j)==2 || Math.abs(k-j)==2 || Math.abs(k-i)==2) s = 1;
						if(currSCount+s > S) continue;
							else{
							if(i>=P || j>=P || k>=P) p = 1;
							
							if(currN == N-1){
								if(currpNumCount+p > bestNum) bestNum=currpNumCount+p;
							}
							else loopCase(scores[currN+1], currN+1, currSCount+s, currpNumCount+p);
						}
					}
				}
			}
		}
	}
}
