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.FileOutputStream;
import java.io.OutputStream;
import java.util.Scanner;


public class EjercicioA {
	public static boolean prueba = false;
	public static void main(String args[]){
		
 		try {
 			FileOutputStream fos = new FileOutputStream(new File("solucion.txt"));
 			OutputStream os = System.out;
 			if (!prueba)
 				os = fos;
			Scanner s = new Scanner(new File("problema.txt"));
			int a = s.nextInt();
			for(int i = 0; i < a; i++){
				int cantP = s.nextInt();
				int sorpresa = s.nextInt();
				int puntos = s.nextInt();
				int total = 0;
				int minP  = 0;
				
				int maxSin = puntos + ((puntos -1) > 0 ? (puntos -1) : 0)*2;
				int maxSorp = puntos + ((puntos -2) > 0 ? (puntos -2) : 0)*2;
				for (int j = 0; j< cantP; j++){
					int totP = s.nextInt();
					if (totP < puntos)
						continue;
					if (totP >= maxSin)
						total++;
					else if (sorpresa > 0 &&  totP >= maxSorp){
						sorpresa --;
						total++;
					}
						
				}
				
				os.write(("Case #" + (i + 1) + ": " + (total) + "\n").getBytes());
				
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
		
	}
}
