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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Dancer {
	
	public static void main (String [] args) throws Exception {
		FileInputStream fstreamIn = new FileInputStream ("B-small-attempt0.in");		
		DataInputStream in  = new DataInputStream (fstreamIn);
		BufferedReader is = new BufferedReader (new InputStreamReader(in));

		FileWriter fstreamOut = new FileWriter ("dancer-output.out");
		BufferedWriter out = new BufferedWriter (fstreamOut);
		
		String line = is.readLine();
		int num = Integer.parseInt(line);
		
		for (int i = 0; i < num; i++) { 
			String str = is.readLine();
			StringTokenizer st = new StringTokenizer (str);
			int n = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			int max = 0;
			for (int j = 0; j < n; j++) {
				int totalScore = Integer.parseInt(st.nextToken());
				
				if (totalScore == 0) {
					if (p == 0) {
						max += 1;
					} 
					continue;
				}
				
				if (totalScore == 1) {
					if (p <= 1) {
						max += 1;
					}
					continue;
				}
				
				
				if (totalScore / 3 >= p) {
					max += 1;
				} else if (totalScore / 3 < (p-2)) {
					continue;
				} else {
					int sumOfTwo = totalScore - p;
					
					int rest = sumOfTwo - (p-1);
					if (rest > p-2) {
						max += 1;
						continue;	
					} 
					
					rest = sumOfTwo - (p-2);
					if (rest >= p-2) {
						if (s != 0) {
							max += 1;
							s -= 1;
						}
					} 
				}
			}
			out.write("Case #" + (i+1) + ": " + max + "\n");
			
		}
		out.close();
		
		

		
	}
	
			
}