package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.*;

public class DancingWithGooglers {

	static int caseNumber;
	static int totalCases;
	
	public static void main(String[] args) throws Exception {
		
		caseNumber = 1;

		File fileIn = new File("C:\\GCJ\\DancingWithGooglers\\B-large.in");
		FileInputStream fileInputStream = null;
		BufferedInputStream inputStream = null;
		BufferedReader reader = null;
		Writer out;
		
		String newLine = System.getProperty("line.separator");
		
		String fileOutPath = "C:\\GCJ\\DancingWithGooglers\\outputLarge.txt";
		File fileOut = new File(fileOutPath);
		if (! fileOut.createNewFile()){
			fileOut.delete();
			fileOut.createNewFile();
		}
		
		out = new OutputStreamWriter(new FileOutputStream(fileOutPath), "US-ASCII");
		
		
		StringBuilder builder = new StringBuilder();

		try {
			fileInputStream = new FileInputStream(fileIn);

			// Here BufferedInputStream is added for fast reading.
			inputStream = new BufferedInputStream(fileInputStream);
			reader = new BufferedReader(new InputStreamReader(inputStream));

			totalCases = Integer.parseInt(reader.readLine());
			while (caseNumber <= totalCases){
				builder.append(handleTestCase(reader));
				builder.append(newLine);
				caseNumber++;
			}
			
			
			// dispose all the resources after using them.
			fileInputStream.close();
			inputStream.close();
			reader.close();

		} catch (Exception e) {
			e.printStackTrace();
		} 
		System.out.print(builder.toString());
		out.write(builder.toString());
		out.close();
	}
	
	public static String handleTestCase(BufferedReader reader) throws IOException{
		String[] splitLine = reader.readLine().split(" ");
		int[] ints = stringArrayToIntArray(splitLine);
		int numScores = ints[0];
		int numSurprises = ints[1];
		int goal = ints[2];
		
		int surprisesLeft = numSurprises;
		int metGoal = 0;
		for(int i = 3; i < ints.length; i++){
			//Base cases
			if(ints[i] == 0) {
				if(goal == 0)
					metGoal++;
			}
			
			else if(ints[i] == 1){
				if(goal == 1)
					metGoal++;
			}
			//Handles if the number is divisible by 3
			//If the average is >= the goal, it is trivially meeting the goal
			//If you allow for a surprise, the max can grow by 1
			else if(ints[i] % 3 == 0){
				if(ints[i] / 3 >= goal)
					metGoal++;
				else if ( ints[i] / 3 == goal - 1){
					if(surprisesLeft > 0) {
						surprisesLeft--;
						metGoal++;
					}
				}
			}
			
			//The value of the maximum doesn't change even with a surprise with ints[i] % 3 ==1
			//So I don't even evaluate it here and worry about deducting available surprises
			else if(ints[i] % 3 == 1){
				if(ints[i] / 3 >= goal-1)
					metGoal++;
			}
			
			//Value of the maximum with % 3 == 2 is one above the average by default
			//Allowing for a surprise allows for it to be one higher
			else if(ints[i] % 3 == 2){ //Unecessary "if" statement kept to remind about the last case
				if(ints[i] / 3 >= goal-1)
					metGoal++;
				else if(ints[i] / 3 == goal - 2){
					if(surprisesLeft > 0) {
						surprisesLeft--;
						metGoal++;
					}
				}
			}
			
		}
		
		if(surprisesLeft > 0)
			System.out.println("Surprises were left: "+surprisesLeft+" on case "+caseNumber);
		return "Case #"+caseNumber+": "+metGoal;
	}
	
	public static int[] stringArrayToIntArray(String[] input){
		int[] ints = new int[input.length];
		for (int i = 0; i < input.length; i++){
			ints[i] = Integer.parseInt(input[i]);
		}
		return ints;
	}
}
