import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.LinkedList;
import java.util.Scanner;

public class DancingWiththeGooglers {

	public static void main(String[] args) throws FileNotFoundException {
		 Scanner in = new Scanner(new File("B-small-attempt5.in"));
//		Scanner in = new Scanner(System.in);
		BufferedWriter out = null;
		try {
			FileWriter fstream = new FileWriter("out.txt");
			out = new BufferedWriter(fstream);
			int cases = in.nextInt();
			int N;
			int S;
			int P;
			LinkedList<Integer> googlers;
			for (int i = 0; i < (cases); i++) {
				int result = 0;
				int surprising = 0;
				int canBe = 0;
				N = in.nextInt();
				S = in.nextInt();
				P = in.nextInt();
				googlers = new LinkedList<Integer>();
				for (int j = 0; j < N; j++) {
					int t = in.nextInt();
					// if (t != 0)
					googlers.add(t);
				}
				for (int j = 0; j < googlers.size(); j++) {
					int temp = googlers.get(j) - (3 * P);
					if (temp == -3 || temp == -4) {
						if (googlers.get(j) != 0) {
							surprising++;
						}
					} else if (temp >= -2) {
						result++;
						if (googlers.get(j) != 29 || googlers.get(j) != 30) {
							canBe++;
						}
					}
				}
				int answer = 0;
				int tempo = 0;
				if (S <= surprising) {
					tempo = S;
				} else {
					tempo = surprising;
					// if(tempo<=canBe)
					// answer=result;
					// tempo = Math.abs(tempo - canBe);
				}
//				System.out.println(result + " " + tempo);
				answer = result + tempo;
				out.write("Case #" + (i + 1) + ": " + answer + "\n");
				System.out.println("Case #" + (i + 1) + ": " + answer);
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
		}

	}
}
