import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

/**
 *
 * @author WC
 */
public class DancingWithGoogler {
	private int numberOfSurprising = 0;
	/**
	 * @param args the command line arguments
	 */
	public static void main(String[] args) {
		(new DancingWithGoogler()).getMaximumBestResults("B-small-attempt1.in", "B-small-attempt1.out", "\n");
	}
	
	private void getMaximumBestResults(String filename, String outputFilename, String separator) {
		int numOfTestCases = CodeJamFileManager.getIntFromFirstLineOfFile(filename, separator);
		String[] testCases = CodeJamFileManager.getTextLinesOfFile(filename, separator);
		String output = "";
		for (int i = 1; i <= numOfTestCases; i++) {
			output += "Case #" + i + ": " + getMaximumBestResultOccurence(testCases[i]) + (i != numOfTestCases ? separator : "");
		}
		CodeJamFileManager.saveOutputFile(output, outputFilename, separator);
	}
	
	private int getMaximumBestResultOccurence(String testCase) {
		int[] intFigures = getIntArrayFromString(testCase.split(" "));
		int numberOfGooglers = intFigures[0];
		numberOfSurprising = intFigures[1];
		int bestResultOf = intFigures[2];
		int counter = 3;
		int maxBestResultOccurence = 0;
		boolean canBeSurprising = true;
		while (counter < intFigures.length) {
			if (numberOfSurprising == 0)
				canBeSurprising = false;
			if (googlerHasBestResult(intFigures[counter], bestResultOf, canBeSurprising))
				maxBestResultOccurence++;
			counter++;
		}
		return maxBestResultOccurence;
	}
	
	private boolean googlerHasBestResult(int score, int bestScoreToBeat, boolean canBeSurprising) {
		int remainder = score % 3;
		int avgScore = score / 3;
		if (avgScore >= bestScoreToBeat) {
			return true;
		}
		else  if (bestScoreToBeat - avgScore == 1) {
			if (remainder != 0) {
				return true;
			}
			else if (canBeSurprising && avgScore != 0) {
				numberOfSurprising--;
				return true;
			}
		}
		else if (bestScoreToBeat - avgScore == 2) {
			if (remainder == 2 && canBeSurprising) {
				numberOfSurprising--;
				return true;
			}
			return false;
		}
		return false;
	}
	
	private int[] getIntArrayFromString(String[] intStrArray) {
		int[] intArray = new int[intStrArray.length];
		int i = 0;
		for (String intStr : intStrArray) {
			intArray[i++] = Integer.parseInt(intStr);
		}
		return intArray;
	}
}