/*
 * 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.util.ArrayList;
import java.util.Scanner;


public class GooglersDancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int noCases = in.nextInt();
		
		for(int i = 0; i < noCases; i++){
			int noGooglers = in.nextInt();
			int noSuprises = in.nextInt();
			int minBestResult = in.nextInt();
			ArrayList<Integer> scores = new ArrayList<Integer>();
			ArrayList<Integer> possibleSurprises = new ArrayList<Integer>();
			for(int j = 0; j < noGooglers; j++){
				scores.add(in.nextInt());
				possibleSurprises.add(0);
			}
			int counter = 0;
			for(int j = 0; j < noGooglers; j++){
				int score = scores.get(j);
				int others = score - minBestResult;
				if(others < 0){
					possibleSurprises.set(j,-2);
					continue;
				}
				if(score < 2){
					possibleSurprises.set(j,-1);
					if(score == 0 && minBestResult == 0){
						counter++;
						continue;
					}
					if(score == 1 && (minBestResult <= 1)){
						counter++;
						continue;
					}
					continue;
				}
				if(score > 28){
					possibleSurprises.set(j,-1);
					counter++;
					continue;
				}
				if(Math.ceil(others / 2) < (minBestResult - 2)){
					possibleSurprises.set(j,-2);
					continue;
				}
				counter++;
				if((others >= minBestResult*2-2) && (others <= minBestResult*2+2)){
					possibleSurprises.set(j,1); //maybe surprise
				}
				else {
					boolean foundMaybe = false;
					for(int k = minBestResult+1; k <= 10; k++){
						others = score - k;
						if((others >= k*2-2) && (others <= k*2+2)){
							possibleSurprises.set(j,1); //maybe surprise
							foundMaybe = true;
							break;
						}
					}
					if(!foundMaybe){
						possibleSurprises.set(j,2); // must be surprise
					}
				}
			}
			
			int must = 0;
			int maybe = 0;
			int noes = 0;
			for(Integer surp : possibleSurprises){
				if(surp.intValue() == 1){
					maybe++;
				}
				if(surp.intValue() == 2){
					must++;
				}
				if(surp.intValue() == -1){
					noes++;
				}
			}
			if(must > noSuprises){
				System.out.println("Case #"+(i+1)+": " + (noSuprises+maybe+noes));
			}
			else{
				System.out.println("Case #"+(i+1)+": " + counter);
			}
		}
	}

}
