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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingWiththeGooglers {
	public static void main(String[] args){
		Scanner in;
		try {
			in = new Scanner(new File("B-large.in"));
			solve(in);
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}
	public static void solve(Scanner in){
		int caseNum = in.nextInt();
		for(int i =1; i<=caseNum; i++){
			int googlers = in.nextInt();
			int surpising = in.nextInt();
			int p =  in.nextInt();
			int ans =0;
			ArrayList<Integer> scores = new ArrayList<Integer>();
			for(int j =0; j<googlers; j++){
				int score =in.nextInt();
				scores.add(score);
				if(score>=p*3-2){
					ans++;
				}
				else{
					int two = p*3-4;
					if(score<4){
						two+=(4-score);
					}
					if(score>=two){
						
						if(surpising>0){
							ans++;
							surpising--;
						}
					}
				}
				
			}
			System.out.println("Case #" +i+": "+ans);
			
		}
	}
}
