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


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader ("data/input"));
		PrintWriter pw = new PrintWriter(new FileWriter("data/output"));
		int lines = Integer.parseInt(br.readLine());
		for(int j = 0; j < lines; j++){
			String sol = "Case #" + (j+1) + ": ";
			StringTokenizer st = new StringTokenizer(br.readLine());
			int googlers = Integer.parseInt(st.nextToken());
			int surprising = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			int googlerOK = 0;
			while(st.hasMoreElements()){
				int score = Integer.parseInt(st.nextToken());
				int value = score/3;
				int mod = score%3;
				if(score == 0){
					if(p==0){
						googlerOK++;
					}
				}else if(value >= p || (mod > 0 && value+1>=p)){
					googlerOK++;
				}else if(mod == 2 && value+2 >= p && surprising > 0){
					surprising--;
					googlerOK++;	
				}else if(mod < 2 && value+1 >= p && surprising > 0){
					surprising--;
					googlerOK++;
				}
			}
			pw.println(sol + ""+ googlerOK);
		}
		pw.close();

	}

}
