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


import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author bilal
 */
public class Googler {

    static String[] inputBuffer;
    static int testCasesCount = 0;

    public Googler(InputStream is) {
        Scanner scanner = new Scanner(is);
        testCasesCount = scanner.nextInt();
        inputBuffer = new String[testCasesCount];
        int loopCounter = 0;
        scanner.nextLine();
        while (scanner.hasNextLine()) {
            String nextTestCase = scanner.nextLine();
            inputBuffer[loopCounter] = nextTestCase;
            loopCounter++;
            if (loopCounter == testCasesCount) {
                break;
            }
        }
    }

    public void solve_Googlers(String[] input) {
        int solution = 0;
        int googlers;
        int surprisingCases;
        int targetHighestScore;
        for (int i = 0; i < input.length; i++) {//iterate over all test cases
            System.out.print("Case #" + (i + 1) + ": ");
            solution = 0;
            StringTokenizer st = new StringTokenizer(input[i]);
            googlers = Integer.parseInt(st.nextToken());
            surprisingCases = Integer.parseInt(st.nextToken());
            targetHighestScore = Integer.parseInt(st.nextToken());
            //create Score objects from remaining tokens
            LinkedList<Integer> sortedScores = new LinkedList<Integer>();
            while (st.hasMoreTokens()) {
                sortedScores.add(Integer.parseInt(st.nextToken()));
            }
            Collections.sort(sortedScores);
            //traverse over sorted collection
            for (int j = googlers - 1; j >= 0; j--) {

                int totalScore = sortedScores.get(j);
                int j1 = (int) Math.ceil(totalScore / 3.0);
                int j2 = (int) Math.ceil((totalScore - j1) / 2.0);
                int j3 = totalScore - j1 - j2;
                //System.out.println(">>>>>"+j1+" "+j2+" "+j3);
                //
                if (j1 >= targetHighestScore) {//this googler scored the higheest target score
                    solution++;
                    continue;
                }
                if (surprisingCases <= 0) {
                    break;//no more surpising cases -> no more solutions
                }
                //deal with surprising cases
                if (j1 == j2 && (j1 + 1) >= targetHighestScore && j2 > 0) {
                    surprisingCases--;
                    solution++;
                }
            }

            System.out.print(solution);
            if (i != input.length - 1) {
                System.out.println();
            }
            //break;//deal with only first case
        }


    }

    public static void main(String[] args) {
        Googler goolger = new Googler(System.in);
        goolger.solve_Googlers(inputBuffer);
    }

    class Scores {

        int totalScore;
        int j1, j2, j3;

        public Scores(int totalScore, int j1, int j2, int j3) {

            this.totalScore = totalScore;
            this.j1 = j1;
            this.j2 = j2;
            this.j3 = j3;
        }
    }
}

