/*
 * 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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;


public class Q2 {

	public static void main (String[] args)
	{
		Scanner s = new Scanner(System.in);
		
		int numTests = s.nextInt();
		for (int test = 0; test < numTests; test++)
		{
			int googlers = s.nextInt();
			int surprises = s.nextInt();
			int threshold = s.nextInt();
			List<Integer> scores = new ArrayList<Integer>(googlers);
			for (int i = 0; i < googlers; i++)
			{
				scores.add(s.nextInt());
			}
			Collections.sort(scores);
			Collections.reverse(scores);
			
			int numAboveThreshold = 0;
			for (int i = 0; i < googlers; i++)
			{
				int score = scores.get(i);
				if (score >= 29)
				{
					//cannot possibly be surprise (10/10/9)
					numAboveThreshold ++;
					continue;
				}
				if (score < threshold)
				{
					//no way we get there
					continue;
				}
				if (3 * threshold - 2 <= score)
				{
					//no need to use a surprise
					numAboveThreshold ++;
					continue;
				}
				if (3 * threshold - 4 <= score && surprises > 0)
				{
					numAboveThreshold ++;
					surprises --;
					continue;
				}
			}
			
			System.out.println("Case #" + (test+1) + ": " + numAboveThreshold);
		}
	}
	
}
