import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


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>{}
}
