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 dancing;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Dance {
	public static void main(String[] args) throws Exception 
	{
		new Dance().run();
	}
	
	void run() throws Exception 
	{	
		Scanner sc = new Scanner(new FileReader("2.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("2.out"));
		
		int ntest = sc.nextInt();
		sc.nextLine();
		
		for(int test=1;test<=ntest;++test) 
		{
			String s = sc.nextLine();
			String[] ss = s.split(" ");			
			int res = 0;
			int min = 0;
			if(Integer.parseInt(ss[2])==0) 
				min = 0;
			else if(Integer.parseInt(ss[2])==1) {
				min = 1;
			}
			else{
				min = (Integer.parseInt(ss[2]))*3-4;
			} 
			int bound = (Integer.parseInt(ss[2]))*3-2;
			int count = Integer.parseInt(ss[1]);
			for(int i=3;i<ss.length;i++){				
				if(Integer.parseInt(ss[i])>=bound)
					res++;
				else if(Integer.parseInt(ss[i])>=min&&count>0){
					res++;
					count--;
				}
			}
			pw.print("Case #" + test + ": "+res);			
			pw.println();
		}
		pw.close();
		sc.close();	
	}

}
