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 DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintStream;
import java.util.regex.Pattern;

/**
 * @(#)DancingGoogler.java, 2012-4-14. 
 * 
 * Copyright 2012 Netease, Inc. All rights reserved.
 * NETEASE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
 */

/**
 *
 * @author bjdengdong
 *
 */
public class DancingGoogler {

    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("E:\\google_code_jam\\B-small-attempt0.in")));
        PrintStream out = new PrintStream(new FileOutputStream("E:\\google_code_jam\\B-small-attempt0.out"));
        
        int cases = Integer.parseInt(br.readLine());
        
        for (int i = 1; i <= cases; i++) {
            String line = br.readLine();
            String[] sp = line.split(Pattern.quote(" "));
            
            int n = Integer.parseInt(sp[0]);//num of googlers
            int s = Integer.parseInt(sp[1]);//num of surprises
            int p = Integer.parseInt(sp[2]);//best score p
            
            int[] scores = new int[n];
            int result = 0;
            int usedSurprise = s;
            for (int j = 0; j < n; j++) {
                scores[j] = Integer.parseInt(sp[j + 3]);
                if (canReachWithoutSuprise(scores[j], p)) {
                    result++;
                } else if (canReachWithSuprise(scores[j], p)) {
                    if (usedSurprise > 0) {
                        result++;
                        usedSurprise--;
                    }
                }
            }
            out.println("Case #" + i + ": " + result);
        }
        out.close();
    }

    private static boolean canReachWithSuprise(int score, int p) {
        if (score == 0 || score == 1)
            return false;
        return (score >= (3 * p - 4)) && (score <= (3 * p - 3));
    }

    private static boolean canReachWithoutSuprise(int score, int p) {
        if (p == 0)
            return true;
        return score >= (3 * p - 2);
    }

}
