import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}


//package b;


import java.io.*;
import java.util.*;
public class Main {
    static int[] good = {0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
    static int[] bad = {0,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,10,10};
    public static void main(String[] args) throws IOException{
        BufferedReader in = new BufferedReader(new FileReader("B.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B.out")));
        int T = Integer.parseInt(in.readLine());
        for(int C = 1; C <= T; C++) doit(C, in, out);
        in.close();
        out.close();
        System.exit(0);
    }
    
    private static void doit(int C, BufferedReader in, PrintWriter out) throws IOException{
        StringTokenizer tok = new StringTokenizer(in.readLine());
        int N = Integer.parseInt(tok.nextToken());
        int surprise = Integer.parseInt(tok.nextToken());
        int P = Integer.parseInt(tok.nextToken());
        
        int[] num = new int[N];
        for(int i = 0; i < N; i++) num[i] = Integer.parseInt(tok.nextToken());
        
        //SOLUTION
        Arrays.sort(num);
        int ans = 0;   
        int countSurprise = 0;
        
        for(int i = 0; i < N; i++){
            if(num[i] >= 2 && num[i] < 28 && good[num[i]] != bad[num[i]] && countSurprise < surprise){
                if(bad[num[i]] >= P) {
                    ans++;
                    countSurprise++;
                }
            }
            else if(good[num[i]] >= P) ans++;
        }
        
        out.println("Case #" + C + ": " + ans);
    }
}
