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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class DancingWithGooglers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		Scanner in;
		in = new Scanner(new FileReader("B-small.in"));
		FileWriter output = new FileWriter("B-small.out");
		
		int T = in.nextInt();
		
		for(int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int pass = 0;
			
			for(int j = 1; j <= N; j++) {
				int x = in.nextInt();
				if(p > x) continue;
				int remaining = x-p;
				if( (remaining/2) >= (p-1) ) {
					pass++;
				} else if ( ( (remaining/2) == (p-2) ) && (S > 0) ) {
					pass++;
					S--;
				}
			}
			
			output.write("Case #" + i + ": " + pass + "\n");
		}
		
		in.close();
		output.flush();
		output.close();

	}

}
