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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ProblemB {
	public static void main(String[] args) throws FileNotFoundException {
//		Scanner sc = new Scanner(new File("B-practice.in"));
		Scanner sc = new Scanner(new File("B-small.in"));
//		Scanner sc = new Scanner(new File("B-large.in"));
		int cases = sc.nextInt();
		for (int i = 1; i <= cases; i++) {
			// do case things here
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int count = 0;
			for (int j = 0; j < n; j++) {
				int t = sc.nextInt();
				if (p == 0) {
					count++;
					continue;
				}
				if (t == 0) {
					continue;
				}
				if (t == 1) {
					if (p == 1) {
						count++;
					}
					continue;
				}
				if (t == 2) {
					if (p == 1) {
						count++;
					}
					if (p == 2) {
						if (s > 0) {
							s--;
							count++;
						}
					}
					continue;
				}
				if (t/3 >= p) {
					count++;
					continue;
				}
				if (t/3 == p - 1 && t % 3 != 0) {
					count++;
					continue;
				}
				if (s > 0) {
					if (t/3 == p-1) {
						count++;
						s--;
						continue;
					}
					if (t/3 == p-2 && t%3 == 2) {
						count++;
						s--;
						continue;						
					}
				}
			}
			System.out.format("Case #%d: %d\n", i, count);
		}
	}
}
