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 java.math.*;
public class scores
{
	static int T=0;
	static int N=0;
	static int S=0;
	static int S2=0;
	static int p=0;
	static int count=0;
	static int ans=0;
	public static void main(String[] args)
	{
		Scanner scan= new Scanner(System.in);
		
		T= Integer.parseInt(scan.nextLine());
		
		for(int i=1; i<=T; i++)
		{
			N=scan.nextInt();
			S=scan.nextInt();
			p=scan.nextInt();
			count=0;
			S2=0;
			ans=0;
			int[] scores= new int[N];
			int x=0;
			for(int j=0; j<N; j++)
			{
				scores[j]= scan.nextInt();
				x=scores[j]/3;
				
				if(3*x==scores[j])
				{
					if(x>0 && x+1>=p && x<p)
						S2++;
					if(x>=p)
						count++;
				}
				if(3*x+1 == scores[j] && x+1>=p)
					count++;
					
				if(3*x+2== scores[j])
				{
					if(x+2>=p && x+1<p)
						S2++;
					if(x+1>=p)
						count++;
				}
			}
			ans=Math.min(S,S2)+count;
			System.out.println("Case #"+i+": "+ans);
		}
	}

}