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


public class Scores 
{
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("B-small-attempt0.in"));
		FileWriter strm = new FileWriter("out2.txt");
		BufferedWriter out = new BufferedWriter(strm);
		int cases = scan.nextInt();
		scan.nextLine();
		int count = 1;
		while(count - 1 < cases)
		{
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int[] tots = new int[n];
			for(int i = 0;i<n;i++)
			{
				tots[i] = scan.nextInt();
			}
			out.write("Case #" + count + ": " + calc(s,p,tots) + "\n");
			count++;
		}
		out.close();
	}
	private static int calc(int s, int p, int[] tots)
	{
		Arrays.sort(tots);
		int surp = 0;
		int max = 0;
		for(int i = 0;i<tots.length;i++)
		{
			if(possible(p,tots[i]))
			{
				boolean surprise = surp(p,tots[i]);
				if(surprise)
					surp++;
				if(surp<=s || !surprise)
					max++;
			}
		}
		return max;
	}
	private static boolean possible(int max, int total)
	{
		if(max == 0)
			return true;
		if(total / max >= 3.0)
			return true;
		if(total < max)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) <= 2.0;
	}
	private static boolean surp(int max, int total)
	{
		if(max == 0)
			return false;
		if(total / max >= 3.0)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) >= 1.5;
	}
}
