/*
 * 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.*;

public class ProblemB {
	public static void main(String[] args) {
		System.out.println("Enter input for case:");
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		int[] nt = new int[T];
		int[] st = new int[T];
		int[] pt = new int[T];
		int[][] ni = new int[T][];
		for (int t = 0; t < T; t++) {
			nt[t] = sc.nextInt();
			st[t] = sc.nextInt();
			pt[t] = sc.nextInt();
			ni[t] = new int[nt[t]];
			for (int j = 0; j < nt[t]; j++)
				ni[t][j] = sc.nextInt();
			sc.nextLine();
		}
		
		
		for (int t = 1; t <= T; t++) {
			int n = nt[t-1]; //number of Googlers
			int s = st[t-1]; //number of surprising triplets of scores
			int p = pt[t-1]; //minimum best result
			int sUsedUp = 0;
			int result = 0;
			
			for (int totalPoints : ni[t-1]) {
				if (totalPoints >= p*3 - 2)
					result++;
				if (p > 1)
					if (totalPoints == p*3 - 4 || totalPoints == p*3 - 3)
						if (sUsedUp < s) {
							result++;
							sUsedUp++;
						}
			}
			
			System.out.println("Case #" + t +": " + result);
		}
		
		

	}

}
