import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
package jam.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingWithTheGooglers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("file.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("file.out"));
			int n = Integer.parseInt(in.readLine());
			for (int i = 1; i <= n; ++i) {
				String[] ints = in.readLine().split(" ");
				int N = Integer.parseInt(ints[0]);
				int S = Integer.parseInt(ints[1]);
				int p = Integer.parseInt(ints[2]);
				int[] ts = new int[N];
				for (int j = 0; j < N; ++j)
					ts[j] = Integer.parseInt(ints[3 + j]);
				int m = 0;
				try {
					m = max(N, S, p, ts);
				}
				catch (Exception e) {
					System.err.println("Unexpected exception, I made a mistake...");
					e.printStackTrace();
					System.exit(1);
				}
				out.write("Case #" + i + ": " + m);
				if (i != n)
					out.newLine();
			}
			out.close();
		}
		catch (Exception e) {
			System.err.println("Unexpected error occured while reading input!");
			e.printStackTrace();
			System.exit(1);
		}
	}
	
	private static int max(int N, int S, int p, int[] ts) {
		if (N > 0) {
			int t = ts[--N];
			int k = t / 3;
			int a, b;
			switch (t % 3) {
				case 0:
					// k k k
					a = (k >= p ? 1 : 0) + max(N, S, p, ts);
					// k-1 k k+1 (*)
					b = (k - 1 >= 0 && k + 1 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				case 1:
					// k k k+1
					a = (k + 1 >= p ? 1 : 0) + max(N, S, p, ts);
					// k-1 k+1 k+1 (*)
					b = (k - 1 >= 0 && k + 1 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				case 2:
					// k k+1 k+1
					a = (k + 1 >= p ? 1 : 0) + max(N, S, p, ts);
					// k k k+2 (*)
					b = (k + 2 >= p ? 1 : 0) + max(N, S - 1, p, ts);
					break;
				default:
					return Integer.MIN_VALUE; // never happens.
			}
			return Math.max(a, b);
		}
		return S == 0 ? 0 : Integer.MIN_VALUE;
	}
}
