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


public class dancing {

	static int max(int a){
		if (a % 3 == 0)
		   return a/3;
		return a/3 + 1;
	}
	static int maxs(int a){
		if (a > 1 && a % 3 != 1)
		   return max(a)+1;
		else return max(a);
	}
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream file = new FileInputStream(args[0]);
        //DataInputStream in = new DataInputStream(file);
        Scanner ins = new Scanner(file);
        BufferedWriter out = new BufferedWriter(new FileWriter(args[1]));
        int n = ins.nextInt();     
        for (int i = 0; i < n; i++){
        	int answ = 0;
        	int t,s,p;
        	t = ins.nextInt(); s = ins.nextInt(); p = ins.nextInt();
        	for (int j = 0; j < t; j++){
        		int tmp = ins.nextInt();
        		if(max(tmp) >= p){
        			answ++; 
        		}else if(maxs(tmp) >= p && s > 0){
        			s--; answ++;
        		}
            }
        	out.write("Case #"+ (i+1) +": "+answ);
        	out.newLine();
        }
        ins.close();
        out.close();
        file.close();
        
	}

}
