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.util.Scanner;

public class Test2
{
	public static void main(String[] args)
	{
		Scanner keyboard = new Scanner(System.in);
		int num = Integer.parseInt(keyboard.nextLine());
		String[] input = new String[num];
		String tmp = "";

		int N = 0;
		int S = 0;
		int P = 0;

		int[] out = new int[num];

		for (int i = 0; i < num; i++)
		{
			input[i] = keyboard.nextLine();
			String[] split = input[i].split(" ");
			N = Integer.parseInt(split[0]); // numbers
			S = Integer.parseInt(split[1]); // surprise
			P = Integer.parseInt(split[2]); // at least
			int[] nums = new int[N];
			for (int j = 0; j < N; j++)
			{
				nums[j] = Integer.parseInt(split[j + 3]);
			}
			int count = 0;
			for (int j = 0; j < N; j++)
			{
				if (P == 0)
				{
					count++;
				}
				else if (nums[j] >= (P * 3 - 2))
				{
					count++;
				}
				else if(nums[j] > 0)
				{
					if (P == 1 && nums[j] >= 3)
					{
						count++;
					}
					else if ((nums[j] - P) >= ((P - 2) * 2))
					{
						if (S > 0)
						{
							S--;
							count++;
						}
					}
				}
			}
			out[i] = count;
		}
		// for(int j=0;j<N;j++)
		// System.out.print(nums[j]+ " ");
		// System.out.println();
		for (int i = 0; i < out.length; i++)
		{
			System.out.println("Case #" + (i + 1) + ": " + out[i]);
		}
	}
}
