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;
	}

}

/**
 *
 *
 * @Author      :Yasith Maduranga(Merlin)
 * @version     :1.0
 * @Date        :2012/4/14
 * @Copyright GSharp Lab, All Rights Reserved....
 */
import java.io.*;
import java.util.*;

class dancinwith {
	public static void main(String args[]){
		try{
	    	BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
	    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));

	    	int noOfCases = Integer.parseInt(br.readLine());

	    	for(int i=0;i<noOfCases;i++){
				String tmp[]=br.readLine().split(" ");
				int noOfGooglers=Integer.parseInt(tmp[0]);
				int noOfSuprisingScores=Integer.parseInt(tmp[1]);
				int bestResult=Integer.parseInt(tmp[2]);
				int maximumNo=0;

				for(int j=3;j<tmp.length;j++){
					int marks=Integer.parseInt(tmp[j]);
					int mod=marks/3;
					switch(marks%3){
						case 0:{
							if(mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 1:{
							if(mod>=bestResult || mod+1>=bestResult ){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 2:{
							if(mod+1>=bestResult || mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+2>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
					}
				}


				out.println("Case #"+(i+1)+": "+maximumNo);
	    	}



	    	out.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	    	System.exit(0);
	}
}
