package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) throws IOException{
		
		String path = "C:\\Users\\Rapol Tongchenchitt\\Documents\\CodeJam\\";
		String year = "Qual2012\\";
		
		String test = "input.txt"; String outPath = "output.txt";
		String a = ""; String A = "";
		String b = "B-large.in"; String B = "B-large.out";
		String c = ""; String C = "";
		String d = ""; String D = "";
		
		String inName = path+year+b;
		String outName = path+year+B;
		
		Scanner in = new Scanner(new FileInputStream(inName));
		BufferedWriter out = new BufferedWriter(new FileWriter(outName));
		
		int caseCount = in.nextInt(); int currentCase = 0;
		
		while(currentCase++ < caseCount){
			
			int dancerCount = in.nextInt();
			int surpriseCount = in.nextInt();
			int minScore = in.nextInt();
			
			int goodCount = 0;
			int maybeCount = 0;
			
			for(int i = 0; i < dancerCount; i++){
				int now = in.nextInt();
				int min;
				
				switch(now%3){
				case 0:
					min = now/3;
					if(min == 0){
						if (minScore == 0){
							goodCount++;
						}
					}else if(min >= minScore){
						goodCount++;
					}else if(min + 1 == minScore){
						maybeCount++;
					}
					break;
					
				case 1:
					min = (now/3) + 1;
					if(min >= minScore){
						goodCount++;
					}
					break;
					
				case 2:
					min = (now/3) + 1;
					if(min >= minScore){
						goodCount++;
					}else if(min + 1 == minScore){
						maybeCount++;
					}
					break;
					
				}
			}
			
			goodCount += Math.min(maybeCount, surpriseCount);
			
			out.write("Case #" + currentCase + ": " + goodCount);
			out.newLine();
		}
		
		out.close();
		
	}
	
}
