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.*;
public class DancingWithTheGooglers {

	public static void main(String[] args)throws IOException {
		BufferedReader bfr = new BufferedReader(
				new InputStreamReader(System.in));
		PrintWriter pr = new PrintWriter(System.out);
		int n = Integer.parseInt(bfr.readLine());
		for (int i = 1 ;i<=n;i++){
			String input []= bfr.readLine().split(" ");
			int googlers = Integer.parseInt(input[0]);
			int surprise = Integer.parseInt(input[1]);
			int max = Integer.parseInt(input[2]);
			int happens =0;
			for (int j =0;j<googlers;j++){
				int googler = Integer.parseInt(input[j+3]);
				int score[] ={(int)(googler/3),((double)googler/3==(int)googler/3)?(int)googler/3:(int)(googler/3)+1,(int) (googler-(Math.floor(googler/3)+(((double)googler/3==(int)googler/3)?(int)googler/3:(int)(googler/3)+1)))};
				if (score[0]>=max||score[1]>=max||score[2]>=max)
					happens++;
				else if (score[0]==score[2]){
					if(score[0]+1>=max&&score[0]-1>=0)
						if (surprise>0){
						happens++;
						surprise--;
						}
				}else if (score[1]==score[2]&&score[0]-1>=0){
					if(score[1]+1>=max)
						if (surprise>0){
						happens++;
						surprise--;
						}
				}
				
			}
			pr.printf("Case #%d: %d\n", i,happens);
			pr.flush();
		}

	}

}
