import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.util.Scanner;


public class Surp {

	/**
	 * @param args
	 */
	public static void main(String[] args) { 
		int T,S,p,N=0;
		String L="";
		Scanner b = new Scanner(System.in);
		T=b.nextInt();
		L=b.nextLine();
		for(int i=0;i<T;i++){
			L=b.nextLine();
			String F[]=L.split(" ");
			N=0;
			S=Integer.parseInt(F[1]);
			p=Integer.parseInt(F[2]);
			int min=p+2*(p-2);
			if(min<=1){
				min=p;
			}
			for(int j=3;j<F.length;j++){
					int val=Integer.parseInt(F[j]);
					if(min<=val){
						if(min+1<val||min==0)
							N++;
						else
							if(S>0){
								S--;
								N++;
							}
						}
				}
			System.out.println("Case #"+(i+1)+": "+N);
			}
		}
	

}
