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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class B {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		File in = new File("b.in");
		File out = new File("b.out");
		
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		Scanner sc = new Scanner(in);
		
		int T = Integer.parseInt(sc.nextLine());
		
		
		for(int i=0;i<T;i++){
			
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			
			
			int surp = 0;
			int count = 0;
			
			
			for(int j=0;j<N;j++){
				int m = sc.nextInt();
				
				
				if(m==0){
					
					if(p==0){
						count++;
					}
										
				}else if(m == 30){
					
					if(p<=10){
						count++;
					}
					
					
				}else if(m%3==0){					
					if(m/3 >= p){
						count++;
					}else if((m/3+1)>=p){
						count++;
						surp++;
					}
					
				}else if(m%3==1){
					
					if((m/3 + 1)>=p){
						count++;
					}					
					
				}else{
					
					if((m/3+1)>=p){
						count++;
					}else if((m/3+2)>=p){
						count++;
						surp++;
					}	
				}				
			}
			
			count = surp<=S ?count:count-(surp-S);
			
			
			bw.write("Case #"+(i+1)+": "+count+"\n");

			
		}
		bw.close();
	}

}
