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


package com.google.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingWithGooglers {
	public static void main(String argsp[]) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("/Users/ashwinjain/Desktop/SmsLogger/InterviewStreet/src/com/google/codejam/in2b.txt")));
		int cases = Integer.parseInt(br.readLine());
		
		for(int x=0;x<cases;x++){
			String temp[] = br.readLine().split(" ");
			int googlers = Integer.parseInt(temp[0]);
			int suprises = Integer.parseInt(temp[1]);
			int minScore = Integer.parseInt(temp[2]);
			
			int nums[] = new int[googlers];
			for(int i=0;i<googlers;i++) {
				nums[i]=Integer.parseInt(temp[i+3]);
			}
			
			int n[] = new int[googlers];
			int s[] = new int[googlers];
			
			for(int i=0;i<googlers;i++){
				if(nums[i]==0){
					n[i]=0;s[i]=0;
				}else if(nums[i]==1){
					n[i]=1;s[i]=1;
				}else if(nums[i]==2){
					n[i]=1;s[i]=2;
				}else if(nums[i]%3==0){
					n[i]=nums[i]/3;
					s[i]=n[i]+1;
				}else if(nums[i]%3==1){
					n[i]=nums[i]/3+1;
					s[i]=n[i];
				}else if(nums[i]%3==2){
					n[i]=nums[i]/3+1;
					s[i]=n[i]+1;
				}
			}
			int ans=0;
			int tempans = 0;
			for(int i=0;i<googlers;i++){
				if(n[i]>=minScore){
					ans++;
					s[i]=-1;
				}
				if(s[i]>=minScore){
					tempans++;
				}
			}
			
			ans = ans+Math.min(suprises, tempans);
			System.out.println("Case #"+(x+1)+": "+ans);
		}
		
	}
}
