/*
 * 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.*;
import java.util.*;
public class Prob2 {
	public static PrintStream out;
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("in.txt"));
		out = new PrintStream(new File("out.txt"));
		int numCases = Integer.parseInt(sc.nextLine());
		int caseNum = 1;
		while(caseNum<=numCases)
			solve(sc.nextLine(), caseNum++);
	}
	public static void solve(String input, int caseNum){
		StringTokenizer st = new StringTokenizer(input, " ");
		int numPeople = Integer.parseInt(st.nextToken());
		int numSurprising = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		LL scores = new LL();
		for(int i=0; i<numPeople; i++)
			scores.push(Integer.parseInt(st.nextToken()));
		Collections.sort(scores);
		int surePass = removeSurePassed(scores, p);
		removeSureUnsurprised(scores);
		int canPass = countCanPass(scores, p);
		int answer = surePass + Math.min(canPass, numSurprising);
		out.println("Case #"+caseNum+": "+answer);
		caseNum++;
	}
	public static void removeSureUnsurprised(LL scores){
		while(!scores.isEmpty() && scores.getFirst()<=1)
			scores.removeFirst();
	}
	public static int removeSurePassed(LL scores, int p){
		int surePassLimit = 3*p-2;
		int origLength = scores.size();
		while(!scores.isEmpty() && scores.getLast()>=surePassLimit)
			scores.removeLast();
		return origLength - scores.size();
	}
	public static int countCanPass(LL scores, int p){
		int canpass = 0;
		for(int i=0; i<scores.size(); i++){
			int cur = scores.get(i);
			if(cur%3==0){
				if(cur/3+1 >= p)
					canpass++;
			}else if(cur%3==2){
				if((cur-2)/3+2 >= p)
					canpass++;
			}
		}
		return canpass;
	}
	public static class LL extends LinkedList<Integer>{}
}
