package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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

import java.io.*;

/**
 *
 * @author BUDDHIMA
 */
public class codejamQB {

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter(new File("outputB-large.txt")));

        int tests = Integer.parseInt(br.readLine());

        for (int testIndex = 1; testIndex <= tests; testIndex++) {

            String[] lineParts = br.readLine().split(" ");

            int googlers = Integer.parseInt(lineParts[0]);
            int suptrip = Integer.parseInt(lineParts[1]);
            int bestVal = Integer.parseInt(lineParts[2]);

            int count = 0;

            int[] totals = new int[googlers];

            // Fill googler total array
            for (int n = 0; n < googlers; n++) {

                totals[n] = Integer.parseInt(lineParts[3 + n]);

            }


            for (int index = 0; index < totals.length; index++) {

                int full = totals[index] / 3;
                int deci = totals[index] % 3;

                if (totals[index] < bestVal) {
                } else if ((full == bestVal - 2 && deci == 2) || (full == (bestVal - 1) && deci == 0)) { // chance to waste supprising values
                    if (suptrip > 0) {
                        suptrip--;
                        count++;
                    }
                } else if (full >= bestVal - 1) { // can compose triplets without using supprising values

                    count++;

                }


            }


            System.out.println(count);

            
            if(testIndex==tests)
            out.write("Case #" + testIndex + ": " + count );
            else out.write("Case #" + testIndex + ": " + count + "\n");



        }




        out.close();
    }
}
