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.util.Scanner;


public class Googlers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String st = in.nextLine();
		
		
		int b = Integer.parseInt(st);
		
		for(int a = 0; a< b; a++)
		{
			st = in.nextLine();
			String sp[] = st.split(" ");
			int n = Integer.parseInt(sp[0]);
			int s = Integer.parseInt(sp[1]);
			int p = Integer.parseInt(sp[2]);
			int g[] = new int[n];
			double gd[] = new double[n];
			int c = 0;
			for(int i = 0;i<n;i++)
			{
				g[i] =  Integer.parseInt(sp[i+3]);
				
				if(g[i] >= (p*3)-2)
					c++;
				else if((g[i] >= (p*3)-4) && s > 0 && g[i]!=0)
				{
					c++;
					s--;
				}
//				gd[i] = ((double)g[i])/3;
			}
			
//			java.util.Arrays.sort(gd);
////			java.util.Arrays.sort(g);
//			
//			for(int i = n-1;i>=0;i--)
//			{
//				if((gd[i] > p) || ((double)p - gd[i] < 1))
//				{
//					c++;
//				}
//				else if((s > 0) && (((double)p-gd[i]) <=1.333333333333334) && gd[i] != 0) 
//				{
//					c++;
//					s--;
//				}
//				else
//					break;
//			}
			
			System.out.println("Case #"+(a+1)+": " + c);
		}		
		
	}

}
