/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.*;
import java.io.*;

public class QR_Bsmall {
	public static void main(String[] args) throws Exception{
		// Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		// Scanner sc = new Scanner(new FileReader("input.in"));
		// PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
		Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-small-attempt0.out"));
		
		
		int T;
		
		int N, S, p;
		int[] t = new int[100];
		int ans;
		
		T = sc.nextInt();
		
		for(int times = 1; times <= T; times++){
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			
			for(int i = 0; i < N; i++){
				t[i] = sc.nextInt();
			}
			
			ans = 0;
			
			for(int i = 0; i < N; i++){
				if(t[i] <= 1){
					if(p <= t[i]){
						ans++;
					}
					continue;
				}
				t[i] = t[i] - (p * 3);
				if(t[i] > -3){
					ans++;
				}else if(t[i] > -5 && S > 0){
					ans++;
					S--;
				}
			}
			
			System.out.print("Case #" + times + ": ");
			System.out.print(ans);
			System.out.println();
			
			
			pw.print("Case #" + times + ": ");
			pw.print(ans);
			pw.println();
			
		}
		
		sc.close();
		pw.close();
		
	}
}

