import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;


public class GooglerScores {

	
	public static void main(String args[]) throws FileNotFoundException {
		
		//////////////////////////////////////
		// Begin Code Jam regular code      //
		//////////////////////////////////////
		
		Scanner inFile = new Scanner(new File("B-small-attempt0.in"));
		PrintStream outFile = new PrintStream(new File("B-small0-out.txt"));
		
		int numCases = inFile.nextInt();
		inFile.nextLine(); // Gets rid of newline char
		
		//////////////////////////////////////
		// End Code Jam regular code        //
		//////////////////////////////////////
		
		for(int i=1; i<=numCases; i++) {
			
			int numGooglers = inFile.nextInt();
			int maxNumSurprising = inFile.nextInt();
			int leastValid = inFile.nextInt();
			
			int validGooglers = 0;
			int validSurprising = 0;
			
			for(int j=0; j<numGooglers; j++) {
				
				int nextTotal = inFile.nextInt();
				int[] normalScore = calcNormalScore(nextTotal);
				int[] surprisingScore = calcSurprisingScore(nextTotal);
				
				if(hasValidScore(normalScore, leastValid)) {
					validGooglers++;
				} else if (hasValidScore(surprisingScore, leastValid) && validSurprising < maxNumSurprising) {
					validGooglers++;
					validSurprising++;
				}
				
			}
			
			printCase(outFile, i, validGooglers);
			
		}
		
	}
	
	
	private static void printCase(PrintStream outStream, int i, int n) {
		outStream.println("Case #" + i +": " + n);
	}
	
	
	private static int[] calcNormalScore(int totalScore) {
		int[] scores = new int[3];
		if(totalScore % 3 == 0) {
			for(int i=0; i<3; i++) {
				scores[i] = totalScore/3;
			}
		} else if(totalScore % 3 == 1) {
			scores[0] = totalScore / 3;
			scores[1] = scores[0];
			scores[2] = scores[0] + 1;
		} else if(totalScore % 3 == 2) {
			scores[0] = totalScore / 3;
			scores[1] = scores[0] + 1;
			scores[2] = scores[1];
		}
		return scores;
	}
	
	private static int[] calcSurprisingScore(int totalScore) {
		int[] scores = new int[3];
		if (totalScore % 3 == 1 || totalScore <= 0) {
			// There is no such surprising score
			for (int i = 0; i < 3; i++)
				scores[i] = 0;
		} else if (totalScore % 3 == 0) {
			scores[0] = totalScore / 3 - 1;
			scores[1] = totalScore / 3;
			scores[2] = totalScore / 3 + 1;
		} else if (totalScore % 3 == 2) {
			scores[0] = totalScore / 3;
			scores[1] = scores[0];
			scores[2] = scores[0] + 2;
		}
		return scores;
	}
	
	
	private static boolean hasValidScore(int[] scores, int leastValid) {
		for(int i=0; i<scores.length; i++) {
			if(scores[i] >= leastValid) return true;
		}
		return false;
	}
	
}
