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.Scanner;
 
public class functions {
	int mod(int a){
	 int b = 0;
	 if(a > 0) b = a; else b = -a;
	 
	 return b;
	}
	int solve(int[] a, int p, int s, int n){
		int result = 0;
		int i = 0;
		int x = 0;
		int onlyS = 0;
		int onlyNotS = 0;
		int both = 0;
		int none = 0;
		for ( i = 0;i < n; i++){
			x = a[i]/3;
			if(a[i]%3 ==0){

				if(a[i] == 30){
					onlyNotS++;

				}
				else if(p==x+1 && a[i]!=0){
					onlyS++;

				}
				else if ( p<=x ){
					both++;

				}
				else{

					none++;
				}
			}
			else if(a[i]%3 ==1){

				if(a[i]==1 && p<=1){
					onlyNotS++;
				}
				else if(p <= x+1){
					both++;
				}
				else none++;
			}
			else{

				if(a[i] == 29){

					onlyNotS++;
				}
				else if(p == x+2){

					onlyS++;
				}		
				else if(p <= x+1){

					both++;
				}
				else {
				none++;

				}				
			}
			
		}
		
		
		if(onlyS <= s){
			result = both+onlyNotS+onlyS;
		}
		else{
			result = s+both+onlyNotS;
		}
		
		return result;
	}
}
