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);
		
		
		
	}
}

package exercise;

public class Solver {
	private static int	VOTES_NB = 3;
	private static int	VARIABLES_NB = 3;
	
	public static Integer[]	solve(Integer[][] input) {
		Integer[]	result = new Integer[input.length];
		
		for (int cnt = 0; cnt < input.length; ++cnt)
			result[cnt] = solve(input[cnt]);
		
		return result;
	}

	public static int	solve(Integer[] input) {
		if (input == null || input.length < 3)
			return 0;
		
		int	googlersNb = input[0];
		int	surprisingTriplets = input[1];
		int	target = input[2];
		
		if (input.length < VARIABLES_NB + googlersNb)
			return 0;
		
		int	result = 0;
		
		Integer[]	candidates = new Integer[surprisingTriplets]; 
		for (int cnt = VARIABLES_NB; cnt < input.length; ++cnt) {
			if (input[cnt] < target * VOTES_NB - (VOTES_NB - 1)) {
				int	minIndex = 0;
				int	min = -1;
				for (int tmp = 0; tmp < candidates.length; ++tmp) {
					if (candidates[tmp] == null || input[cnt] > candidates[tmp]) {
						if (candidates[tmp] == null || min == -1 || candidates[tmp] < min) {
							min = (candidates[tmp] == null) ? 0 : candidates[tmp];
							minIndex = tmp;
						}
					}
				}
				if (min >= 0 && input[cnt] >= min)
					candidates[minIndex] = input[cnt];
			} else
				++result;
		}
		
		if (candidates.length > 0) {
			int	surprisingTarget = target + target - 2 + target - 2;
			if (surprisingTarget <= 0)
				surprisingTarget = target;
			if (candidates != null)
				for (int cnt = 0; cnt < candidates.length; ++cnt)
					if (candidates[cnt] != null && candidates[cnt] >= surprisingTarget)
						result++;
		}
		
		return result;
	}
}
