import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;

/**
 * Created with IntelliJ IDEA.
 * User: vikash
 * Date: 14/04/12
 * Time: 9:51 AM
 * To change this template use File | Settings | File Templates.
 */
public class DancingGooglers {

    static int[][] getPossibleCombinations(int totalPoints) {
        int averagePoint = totalPoints / 3;
        int remainder = totalPoints % 3;
        int[][] possibleCombinations;
        if (totalPoints >= 2 && totalPoints <= 28) {
            possibleCombinations = new int[2][3];
            if (remainder == 0) {
                possibleCombinations[1] = new int[]{averagePoint, averagePoint, averagePoint};
                possibleCombinations[0] = new int[]{averagePoint + 1, averagePoint, averagePoint - 1};
            } else if (remainder == 1) {
                possibleCombinations[1] = new int[]{averagePoint + 1, averagePoint, averagePoint};
                possibleCombinations[0] = new int[]{averagePoint + 1, averagePoint + 1, averagePoint - 1};
            } else { //remainder == 2
                possibleCombinations[1] = new int[]{averagePoint + 1, averagePoint + 1, averagePoint};
                possibleCombinations[0] = new int[]{averagePoint + 2, averagePoint, averagePoint};
            }
        } else {
            possibleCombinations = new int[1][3];
            if (totalPoints == 0) {
                possibleCombinations[0] = new int[]{0, 0, 0};
            } else if (totalPoints == 1) {
                possibleCombinations[0] = new int[]{1, 0, 0};
            } else if (totalPoints == 29) {
                possibleCombinations[0] = new int[]{10, 10, 9};
            } else if (totalPoints == 30) {
                possibleCombinations[0] = new int[]{10, 10, 10};
            }
        }
        return possibleCombinations;
    }

    static boolean isBestScoreMet(int[] possibleCombination, int bestScore) {
        for (int i = 0; i < possibleCombination.length; i++) {
            return possibleCombination[i] >= bestScore;
        }
        return false;
    }

    static boolean isSurprisingTriplet(int[] possibleCombination) {
        for (int i = 0; i < possibleCombination.length; i++) {
            for (int j = i + 1; j < possibleCombination.length; j++) {
                return Math.abs(possibleCombination[i] - possibleCombination[j]) == 2;
            }
        }
        return false;
    }

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("/Users/vikash/DancingGooglersIn.txt"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("/Users/vikash/DancingGooglersOut.txt"));
        int testCases = Integer.parseInt(br.readLine());
        int currentTest = 1;
        while (currentTest <= testCases) {
            String[] numbers = br.readLine().split(" ");
            int numberOfGooglers = Integer.parseInt(numbers[0]);
            int numberOfSurprisingTriplets = Integer.parseInt(numbers[1]);
            int minBestResult = Integer.parseInt(numbers[2]);
            int[] googlersTotalScore = new int[numberOfGooglers];
            for (int i = 3; i < numbers.length; i++) {
                googlersTotalScore[i - 3] = Integer.parseInt(numbers[i]);
            }
            Arrays.sort(googlersTotalScore);
            int qualifyingGooglers = 0;
            boolean minConditionMet = false;
            int optionalSurprisingTriplets = 0;
            for (int i = 0; i < googlersTotalScore.length; i++) {
//                if (minConditionMet) {
//                    qualifyingGooglers++;
//                } else {
                    int[][] possibleCombinations = getPossibleCombinations(googlersTotalScore[i]);
                    boolean isBestResultMet = isBestScoreMet(possibleCombinations[0], minBestResult);
                    if (isBestResultMet && numberOfSurprisingTriplets <= 0 && optionalSurprisingTriplets == 0) {
                        if (possibleCombinations.length == 2) {
                            isBestResultMet = isBestScoreMet(possibleCombinations[1], minBestResult);
                        }
                    }
                    if (isBestResultMet) {
                        if(numberOfSurprisingTriplets<=0) {
                            optionalSurprisingTriplets--;
                        }
                        qualifyingGooglers++;
                        if (googlersTotalScore[i]/3 >= minBestResult) {
                            minConditionMet = true;
                        }
                    }
                    if (possibleCombinations.length == 2 && numberOfSurprisingTriplets > 0) {
                        numberOfSurprisingTriplets--;
                        if(!isBestResultMet) {
                            optionalSurprisingTriplets++;
                        }
                    }
//                }
            }
            bw.write("Case #" + currentTest + ": " + qualifyingGooglers);
            bw.newLine();
            currentTest++;
        }
        bw.close();
        br.close();
    }
}
