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.*;
import java.util.*;
import static java.lang.System.*;

public class B
{
	// non-surprising
	public static int best1(int x)
	{
		if (x%3 == 0) return x/3;
		else return x/3+1;
	}
	// surprising
	public static int best2(int x)
	{
		if (x == 0) return 0;
		return (x+1)/3+1;
	}
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(in);
		int t = sc.nextInt();
		for (int c = 1; c <= t; c++)
		{
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] arr = new int[31];
			for (int i = 0; i < n; i++) arr[sc.nextInt()]++;
			int ctr = 0;
			for (int i = 30; i >= 0; i--)
			{
				if (best1(i) >= p)
				{
					ctr += arr[i];
				}
				else
				{
					if (i > 1 && best2(i) >= p)
					{
						ctr += Math.min(s, arr[i]);
						if (s > arr[i]) s -= arr[i];
						else s = 0;
					}
				}
			}
			out.printf("Case #%d: %d\n", c, ctr);
		}
	}
}
