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

public class Dancing {
	private static Scanner stdIn = new Scanner(System.in);
	
	public static void getMax(int arr[])
	{
		for (int i = 0; i < arr.length; i++)
		{
			int t = arr[i];
			if ((t % 3) == 0)
			{
				arr[i] = t / 3;
			} else
			{
				arr[i] = (t / 3) + 1;
			}
		}
	}

	public static int howMany(int scores[], int surprising, int p)
	{
		int total = 0;
		
		getMax(scores);
		
		for (int i = 0; i < scores.length; i++)
		{
			int t = scores[i];
			
			if (t >= p)
			{
				total++;
			} else if ((surprising > 0) && (t == (p - 1)) && (t > 0))
			{
				total++;
				surprising--;
			}
		}

		return total;
	}

	public static void main(String args[])
	{
		int T; // number of test cases
		int caseNo = 1; // number of current case

		// scan number of test cases
		T = stdIn.nextInt();

		// while there's cases to process
		while (T-- != 0)
		{
			// case variables
			int N, S, p;
			int scores[]; // array to hold scores

			// read variables
			N = stdIn.nextInt();
			S = stdIn.nextInt();
			p = stdIn.nextInt();
			scores = new int[N];

			// read scores
			for (int i = 0; i < N; i++)
			{
				scores[i] = stdIn.nextInt();
			}					

			// print results
			System.out.println("Case #" + caseNo++ + ": " + howMany(scores, S, p));
		}
	}
}
