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

import java.util.HashMap;
import java.util.Scanner;

public class CodeJamB {
	public static void main(String args[]){
		
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		int n;
		int s;
		int p;
		int triplet;
		int result;
		int score;

	
		for(int i = 0; i < t; i++){
			n = scn.nextInt();
			s = scn.nextInt();
			p = scn.nextInt();
			triplet = 0;
			result = 0;
			
			for(int j = 0; j < n; j++){
				score = scn.nextInt();
				if(score > ((p * 3) - 3)){
					result ++;
				}else if(score > 2 && score > ((p * 3) - 5) && triplet < s){
					result ++;
					triplet ++;
				}


			}
			
			System.out.println("Case #" + ( i + 1 ) + ": " + result);
			
		}
	}
}
