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


public class Googlers {

	static public int min(int a, int b){
		return a < b ? a : b;
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		File f = new File( "B-small-attempt2.in" );
		FileWriter out=new FileWriter("output.txt");

		Scanner in = new Scanner(new FileReader(f));

		if(f.exists()){
			int T;
			int N, S, p;
			int[] t = new int[100];
			
			T = in.nextInt();
			
			for(int i = 1; i <= T; i++){
				
				N = in.nextInt();
				S = in.nextInt();
				p = in.nextInt();
				
				int sup = 0;
				int litige = 0;
				
				for(int j = 0; j < N ; j++)
					t[j] = in.nextInt();
				
				for(int j = 0; j < N ; j++){
					if(t[j] >= 3*p-2)
						sup++;
					else
						if(t[j] >= 3*p-4 && 3*p-4 >= 0)
							litige++;
					

				}
				out.write("Case #" + i +": " + (sup+ min(S, litige))+ "\n");
			
			
			}
		}

		in.close();
		out.close();

		
	}
}
